The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements.
Hagos, Elias M.
The Electronic Journal of Combinatorics [electronic only], Tome 7 (2000), / Harvested from The Electronic Library of Mathematics
Access to full text
Full (PDF)
Publié le : 2000-01-01
EUDML-ID : urn:eudml:doc:120317 
@article{01413178,
     title = {The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements.},
     journal = {The Electronic Journal of Combinatorics [electronic only]},
     volume = {7},
     year = {2000},
     zbl = {0938.05044},
     language = {en},
     url = {http://dml.mathdoc.fr/item/01413178}
}

Hagos, Elias M. The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements.. The Electronic Journal of Combinatorics [electronic only], Tome 7 (2000) . http://gdmltest.u-ga.fr/item/01413178/