| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4603642 | Linear Algebra and its Applications | 2007 | 9 Pages |
Abstract
This paper is concerned with the spectral version of the reconstruction conjecture: Whether a graph with n>2 vertices is determined (up to isomorphism) by the collection of its spectrum and the spectrum of its vertex-deleted graphs? Some positive results as well as a method for constructing counterexamples to the problem are provided.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
