The structure of trivalent graphs with minimal eigenvalue gap
From MaRDI portal
Let \(G\) be a connected cubic graph on \(n\) vertices \((n\geq 10)\) with a maximal second largest eigenvalue (of the adjacency matrix). It is shown that \(G\) is reduced path-like what means that the block intersection graph of \(G\) is a path with blocks having 2, 4, 5, 6 or 7 vertices. This result partially verifies an implicit conjecture of \textit{F. C. Bussemaker}, \textit{S. Čobeljić}, the reviewer and \textit{J. J. Seidel} [J. Comb. Theory, Ser. B 23, 234-235 (1977; Zbl 0369.05045)].
Recommendations
Cites work
Cited in
(8)- Regular graphs with minimum spectral gap
- Gap sets for the spectra of regular graphs with minimum spectral gap
- Maximum spread of graphs and bipartite graphs
- Quartic graphs with minimum spectral gap
- Minimum algebraic connectivity and maximum diameter: Aldous-Fill and Guiduli-Mohar conjectures
- Extremal spectral radius of nonregular graphs with prescribed maximum degree
- Graphs of degree at least \({3}\) with minimum algebraic connectivity
- Cubic bipartite graphs with minimum spectral gap
This page was built for publication: The structure of trivalent graphs with minimal eigenvalue gap
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1370464)