Spectral characterization of the complete graph removing a path

DOI10.1016/J.DAM.2020.04.011MaRDI QIDQ777427zbMATH OpenOpenAlexFDO

Authors Muhuo Liu, Hai-Ying Shan, Xiaofeng Gu

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 spectrumcospectral graphspectral characterization

Mathematics Subject Classification ID

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

Recommendations

• Spectral characterization of the complete graph removing a path of small length
• Spectral characterization of the complete graph removing a path: completing the proof of Cámara-Haemers conjecture
• scientific article; zbMATH DE number 5952200
• The spectral characterization of graphs of index less than 2 with no path as a component
• scientific article; zbMATH DE number 1156653
• Spectral characterizations of almost complete graphs
• Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
• Bounds for the spectral radius of a graph when nodes are removed
• Spectral determination of graphs whose components are paths and cycles
• On the spectral characterizations of graphs

Cites work

• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 3394189 (Why is no real title available?)
• Interlacing eigenvalues and graphs
• Some notes on the extremal k-generalized quasi-unicyclic graphs with respect to Zagreb indices
• Spectra of graphs
• Spectral characterization of the complete graph removing a path of small length
• Spectral characterizations of almost complete graphs
• The complement of the path is determined by its spectrum
• Which graphs are determined by their spectrum?

Cited in

(8)

• Spectral characterization of the complete graph removing a path of small length
• Majorization, degree sequence and \(A_\alpha\)-spectral characterization of graphs
• The spectral characterization of graphs of index less than 2 with no path as a component
• Per-spectral and adjacency spectral characterizations of a complete graph removing six edges
• Spectral characterization of the complete graph removing a path: completing the proof of Cámara-Haemers conjecture
• Spectral characterizations of almost complete graphs
• \(\mathrm{Kite}_{p+2,p}\) is determined by its Laplacian spectrum
• Spectral characterization of the complete graph removing a cycle

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777427)