Constructing graphs with given spectrum and the spectral radius at most 2
From MaRDI portal
Publication:501283
DOI10.1016/J.LAA.2016.11.020zbMATH Open1352.05109OpenAlexW2550862472MaRDI QIDQ501283FDOQ501283
Authors: Irena M. Jovanović, Dragoš 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
Recommendations
- Some constructions of graphs with integral spectrum
- Graphs whose \(A_\alpha \) -spectral radius does not exceed 2
- Graphs with given diameter maximizing the spectral radius
- On the spectral radius of minimally 2-(edge)-connected graphs with given size
- On the spectral radius of graphs
- Spectral radius of graphs with given matching number
- A bound on the spectral radius of graphs
- A conjecture on the spectral radius of graphs
- On minimally 2-(edge)-connected graphs with extremal spectral radius
- Graphs with given degree sequence and maximal spectral radius
Cites Work
- Which graphs are determined by their spectrum?
- An introduction to the theory of graph spectra
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectral characterization of graphs with index at most \(\sqrt {2+\sqrt {5}}\)
- Spektren endlicher Grafen
- Graph \(Z_{n}\) and some graphs related to \(Z_{n}\) are determined by their spectrum
- Spectral determination of graphs whose components are paths and cycles
- The spectral characterization of graphs of index less than 2 with no path as a component
- On Systems of Linear Diophantine Equations
- The spectral characterization of graphs of index less than 2 with no \(Z_n\) as a component.
- Title not available (Why is that?)
- The cospectral equivalence classes of graphs having an isolated vertex
Cited In (4)
This page was built for publication: Constructing graphs with given spectrum and the spectral radius at most 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q501283)
