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

DOI10.1016/j.laa.2016.11.020zbMath1352.05109OpenAlexW2550862472MaRDI QIDQ501283

Irena M. Jovanović, Dragos Cvetković

Publication date: 29 December 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2016.11.020

zbMATH Keywords

cospectral graphsDiophantine equationadjacency spectrumcospectral equivalence classDS-graph

Mathematics Subject Classification ID

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

Related Items (2)

Unnamed Item ⋮ Cospectrality graphs of Smith graphs

Cites Work

• Spectral determination of graphs whose components are paths and cycles
• Spektren endlicher Grafen
• Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
• The cospectral equivalence classes of graphs having an isolated vertex
• Which graphs are determined by their spectrum?
• 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
• On Systems of Linear Diophantine Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructing graphs with given spectrum and the spectral radius at most 2