The cospectral equivalence classes of graphs having an isolated vertex

DOI10.1016/J.CAMWA.2009.03.054zbMATH Open1186.05083OpenAlexW2049781482MaRDI QIDQ971680FDOQ971680

Qiongxiang Huang, Ru Ying Liu, Jianfeng Wang, Chengfu Ye, Yongzhi 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

Recommendations

• The spectral characterization of graphs of index less than 2 with no path as a component
• The spectral characterization of graphs of index less than 2 with no \(Z_n\) as a component.
• On the generalized spectral characterization of graphs having an isolated vertex
• Graphs with few distinct \(D\)-eigenvalues determined by their \(D\)-spectra
• On the spectral characterization of the union of complete multipartite graph and some isolated vertices

zbMATH Keywords

spectral radiusadjacency spectrumcospectral graphcospectral equivalence classDS-graph

Mathematics Subject Classification ID

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

Cites Work

• Which graphs are determined by their spectrum?
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• The complement of the path is determined by its spectrum
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
• Title not available (Why is that?)
• The largest eigenvalue of a graph: A survey
• Acyclic molecules with greatest HOMO-LUMO separation
• The spectral characterization of graphs of index less than 2 with no path as a component
• On the generalized spectral characterization of graphs having an isolated vertex
• Title not available (Why is that?)
• Circulant digraphs determined by their spectra

Cited In (7)

• A factor of non-DS graphs
• On the generalized spectral characterization of graphs having an isolated vertex
• Non-isomorphic graphs with cospectral symmetric powers
• Title not available (Why is that?)
• Characterizing cospectral vertices via isospectral reduction
• Constructing graphs with given spectrum and the spectral radius at most 2
• So's conjecture for integral circulant graphs of 4 types

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

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