# 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] (2000)

- Volume: 7, Issue: 1, page Research paper R12, 9 p.-Research paper R12, 9 p.
- ISSN: 1077-8926

## Access Full Article

top## How to cite

topHagos, 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] 7.1 (2000): Research paper R12, 9 p.-Research paper R12, 9 p.. <http://eudml.org/doc/120317>.

@article{Hagos2000,

author = {Hagos, Elias M.},

journal = {The Electronic Journal of Combinatorics [electronic only]},

keywords = {characteristic polynomial; graph reconstruction},

language = {eng},

number = {1},

pages = {Research paper R12, 9 p.-Research paper R12, 9 p.},

publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},

title = {The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements.},

url = {http://eudml.org/doc/120317},

volume = {7},

year = {2000},

}

TY - JOUR

AU - Hagos, Elias M.

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 [electronic only]

PY - 2000

PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos

VL - 7

IS - 1

SP - Research paper R12, 9 p.

EP - Research paper R12, 9 p.

LA - eng

KW - characteristic polynomial; graph reconstruction

UR - http://eudml.org/doc/120317

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.