Spectral characterization of the complete graph removing a path of small length

DOI10.1016/j.dam.2018.08.029zbMath1406.05065arXiv1804.08263OpenAlexW2964322163WikidataQ128977680 ScholiaQ128977680MaRDI QIDQ1730244

Sebastian M. Cioabă, Wei Wang, Lihuan Mao

Publication date: 11 March 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.08263

zbMATH Keywords

cospectral graphsgraph spectrumspectral characterization

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items

$Kite_{p+2,p}$ is determined by its Laplacian spectrum, Spectral characterization of the complete graph removing a path: completing the proof of Cámara-Haemers conjecture, Spectral characterization of the complete graph removing a cycle, Majorization, degree sequence and \(A_\alpha\)-spectral characterization of graphs, On the second largest \(A_{\alpha}\)-eigenvalues of graphs, Spectral characterization of the complete graph removing a path, Aα and Lα-spectral properties of spider graphs

Cites Work

• On the spectral characterization of pineapple graphs
• Spectral characterizations of almost complete graphs
• The spectral characterization of \(\infty\)-graphs
• On a signless Laplacian spectral characterization of \(T\)-shape trees
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Spectral characterizations of lollipop graphs
• Developments on spectral characterizations of graphs
• A note on the spectral characterization of \(\theta \)-graphs
• Which graphs are determined by their spectrum?
• The complement of the path is determined by its spectrum
• The kite graph is determined by its adjacency spectrum
• On the spectral characterization of T-shape trees
• On fat Hoffman graphs with smallest eigenvalue at least -3