Bicyclic graphs for which the least eigenvalue is minimum

DOI10.1016/j.laa.2008.10.026zbMath1194.05093OpenAlexW2112107788MaRDI QIDQ999810

Bojana Borovićanin, Tatjana M. Aleksić, Miroslav M. Petrović

Publication date: 10 February 2009

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

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

zbMATH Keywords

adjacency matrixindexspreadleast eigenvaluebicyclic graphgreatest eigenvalue

Mathematics Subject Classification ID

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

Related Items (22)

Characterization of the minimizing graph of the connected graphs whose complements are bicyclic ⋮ Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) ⋮ The least eigenvalue of graphs with cut edges ⋮ On the least eigenvalue of cacti with pendant vertices ⋮ Minimal spread of integral circulant graphs ⋮ Maximum spread of \(K_{2,t}\)-minor-free graphs ⋮ Minimizing graph of the connected graphs whose complements are bicyclic with two cycles ⋮ Cacti whose spread is maximal ⋮ A note on connected bipartite graphs of fixed order and size with maximal index ⋮ On least eigenvalues of bicyclic graphs with fixed number of pendant vertices ⋮ The least eigenvalue of a graph with a given domination number ⋮ Bound on the least eigenvalue of a graph with cut vertices ⋮ Spectral conditions for the existence of specified paths and cycles in graphs ⋮ The least eigenvalue of a graph with cut vertices ⋮ Further results on the least eigenvalue of connected graphs ⋮ On the least eigenvalue of cacti ⋮ The least eigenvalue of the complements of trees ⋮ The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph ⋮ The signless Laplacian spread ⋮ The least eigenvalue of graphs whose complements have only two pendent vertices ⋮ The least eigenvalue of graphs whose complements are unicyclic ⋮ Least eigenvalue of the connected graphs whose complements are cacti

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A table of connected graphs on six vertices
• Graphs for which the least eigenvalue is minimal. I
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• The spectral radius of trees on \(k\) pendant vertices
• Graphs and combinatorics. Proceedings of the capital conference on graph theory and combinatorics at the George Washington University, June 18-22, 1973
• The largest eigenvalue of a graph: A survey
• The spread of the spectrum of a graph

This page was built for publication: Bicyclic graphs for which the least eigenvalue is minimum