Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/28359
Title: | Polynomial reconstruction : old and new techniques |
Authors: | Sciriha, Irene |
Keywords: | Polynomials Eigenvalues Mathematics -- Charts, diagrams, etc. Mathematics -- Problems, exercises, etc. |
Issue Date: | 2002 |
Publisher: | Universita degli Studi di Messina |
Citation: | Sciriha, I. (2002). Polynomial reconstruction : old and new techniques. Rendiconti del Seminario Matematico Messina, 8(24)(II), 163-179. |
Abstract: | The Polynomial Reconstruction Problem (PRP) asks whether for a graph G of order at least three, the characteristic polynomial can be reconstructed from the p-deck PD(G) of characteristic polynomials of the one-vertex-deleted subgraphs. The problem is still open in general but has been proved for certain classes of graphs. We discuss the tools and techniques most commonly used and survey the main positive results obtained so far, pointing out the classes of graphs for which we know that the PRP has a positive resolution. |
URI: | https://www.um.edu.mt/library/oar//handle/123456789/28359 |
Appears in Collections: | Scholarly Works - FacSciMat |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Polynomial_reconstruction_old_and_new_techniques_2002.pdf | 224.52 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.