Spectral characterization of the complete graph removing a path

DOI10.1016/j.dam.2020.04.011zbMath1443.05114OpenAlexW3020473969MaRDI QIDQ777427

Hai-Ying Shan, Xiaofeng Gu, Muhuo Liu

Publication date: 7 July 2020

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

Full work available at URL: https://doi.org/10.1016/j.dam.2020.04.011

zbMATH Keywords

adjacency spectrumspectral characterizationcospectral graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

$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

Cites Work

• Unnamed Item
• Unnamed Item
• Spectral characterizations of almost complete graphs
• Spectra of graphs
• Some notes on the extremal \(k\)-generalized quasi-unicyclic graphs with respect to Zagreb indices
• Which graphs are determined by their spectrum?
• Spectral characterization of the complete graph removing a path of small length
• The complement of the path is determined by its spectrum
• Interlacing eigenvalues and graphs

This page was built for publication: Spectral characterization of the complete graph removing a path