Notes on the polynomial reconstruction of signed graphs (Q2134985)

The polynomial reconstruction problem for unsigned graphs was posed by Cvetković in 1973. The author considered the problem of reconstructing the characteristic polynomial of a signed graph from the collection of characteristic polynomials of its vertex-deleted subgraphs. Also, he resolved this problem for several classes of (signed) graphs including particular subclasses of signed graphs with pendant vertices, signed bundles, bicyclic signed graphs without pendant vertices, and signed graphs with at most 8 vertices. The author relates the uniqueness of the reconstruction to the chemical invariant known as the HOMO-LUMO index, which is interesting. In the final section, some computational results are presented, some open problems are formulated, and related comments are given, but theoretical results are not established. This article contains many eye-opening results for younger researchers in this area.