On the spectral characterization of the union of complete multipartite graph and some isolated vertices

DOI10.1016/j.disc.2010.09.004zbMath1200.05132OpenAlexW2054320079MaRDI QIDQ607028

Haizhen Ren, Haicheng Ma

Publication date: 19 November 2010

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

Full work available at URL: https://doi.org/10.1016/j.disc.2010.09.004

zbMATH Keywords

cospectral graphsadjacency spectrumcospectral equivalence classDS-graph

Mathematics Subject Classification ID

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

Related Items (3)

Complete split graph determined by its (signless) Laplacian spectrum ⋮ Laplacian spectral characterization of some graphs obtained by product operation ⋮ Graphs with all but two eigenvalues in \([-2, 0\)]

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizing distance-regularity of graphs by the spectrum
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• Spectral characterization of some generalized odd graphs
• Which graphs are determined by their spectrum?
• The complement of the path is determined by its spectrum
• Graphs determined by polynomial invariants
• On the spectral characterization of T-shape trees
• 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
• No starlike trees are cospectral

This page was built for publication: On the spectral characterization of the union of complete multipartite graph and some isolated vertices