Geodesic
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, Tome 7 (2000)
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

The question of whether the characteristic polynomial of a simple graph is uniquely determined by the characteristic polynomials of its vertex-deleted subgraphs is one of the many unresolved problems in graph reconstruction. In this paper we prove that the characteristic polynomial of a graph is reconstructible from the characteristic polynomials of the vertex-deleted subgraphs of the graph and its complement.
DOI : 10.37236/1490
Classification : 05C60, 05C50
Mots-clés : characteristic polynomial, graph reconstruction 
@article{10_37236_1490,
     author = {Elias M. Hagos},
     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},
     year = {2000},
     volume = {7},
     doi = {10.37236/1490},
     zbl = {0938.05044},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1490/}
}
TY  - JOUR
AU  - Elias M. Hagos
TI  - The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
JO  - The electronic journal of combinatorics
PY  - 2000
VL  - 7
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1490/
DO  - 10.37236/1490
ID  - 10_37236_1490
ER  - 
%0 Journal Article
%A Elias M. Hagos
%T The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
%J The electronic journal of combinatorics
%D 2000
%V 7
%U http://geodesic.mathdoc.fr/articles/10.37236/1490/
%R 10.37236/1490
%F 10_37236_1490
Elias M. Hagos. 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, Tome 7 (2000). doi: 10.37236/1490

Cité par Sources :