The cospectral equivalence classes of graphs having an isolated vertex

DOI10.1016/j.camwa.2009.03.054zbMath1186.05083OpenAlexW2049781482MaRDI QIDQ971680

Jianfeng Wang, Chengfu Ye, Yongzhi Liu, Qiong Xiang Huang, Ru-Ying Liu

Publication date: 16 May 2010

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2009.03.054

zbMATH Keywords

spectral radiusadjacency spectrumcospectral graphcospectral equivalence classDS-graph

Mathematics Subject Classification ID

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

Related Items

Constructing graphs with given spectrum and the spectral radius at most 2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Ordering graphs with index in the interval \((2, \sqrt{2+\sqrt 5})\)
• Spectral characterization of the Hamming graphs
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• Which graphs are determined by their spectrum?
• The complement of the path is determined by its spectrum
• Acyclic molecules with greatest HOMO-LUMO separation
• On the generalized spectral characterization of graphs having an isolated vertex
• The spectral characterization of graphs of index less than 2 with no path as a component
• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
• The largest eigenvalue of a graph: A survey
• Circulant digraphs determined by their spectra

This page was built for publication: The cospectral equivalence classes of graphs having an isolated vertex