The complement of the path is determined by its spectrum
By Michael Doob, Willem H. Haemers. 2002
63 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/4518cab9c0833f088948a7754723e109b93a2882
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- Andries E. Brouwer
- Willem H. Haemers
- Yuanping Zhang
- Yaoping Hou
- Dragos M. Cvetkovic
- Sebastian M. Cioaba
- Slobodan K. Simic
- Thomas Zaslavsky
In Electrical and Electronic Engineering
In Geometry and Topology
- Andries E. Brouwer
- Willem H. Haemers
- Yuanping Zhang
- Yaoping Hou
- Dragos M. Cvetkovic
- Sebastian M. Cioaba
- Slobodan K. Simic
- Ivan Gutman
Citations in the corpus
- Which graphs are determined by their spectrum (2003, background): “• Which trees are DS? Or, more modestly: Which trees are not cospectral to another tree? Some non-trivial results can be found in [33,52].”
- Graph Zn and some graphs related to Zn are determined by their spectrum (2005, background): “The following known results can be found in [3,4]:”
- Spectral characterizations of lollipop graphs (2008, unknown): “The following known results can be found in [2,3,7,8,11,12,13,14].”
- Spectra of Graphs (2011, background): “The result for A, however, is nontrivial and the subject of [157].”