Bicyclic graphs for which the least eigenvalue is minimum

DOI10.1016/J.LAA.2008.10.026zbMATH Open1194.05093OpenAlexW2112107788MaRDI QIDQ999810FDOQ999810

Authors: B. Borovićanin, Miroslav Petrović, Tatjana M. Aleksić 

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

Recommendations

• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• On the spectral spread of bicyclic graphs with given girth
• The minimum Laplacian spread of unicyclic graphs
• scientific article; zbMATH DE number 5926156
• The least eigenvalue of unicyclic graphs with application to spectral spread

zbMATH Keywords

indexadjacency matrixleast eigenvaluespreadbicyclic graphgreatest eigenvalue

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (33)

• The minimax, maximin, and spread values for open neighborhood sums for 2-regular graphs
• On the least eigenvalue of cacti with pendant vertices
• On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
• Minimizing the least eigenvalue of bicyclic graphs with \(k\) pendant vertices.
• Minimal spread of integral circulant graphs
• The spread of tetracyclic graphs
• The least eigenvalue of graphs whose complements have only two pendent vertices
• The least eigenvalue of graphs whose complements are unicyclic
• Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
• Spectral conditions for the existence of specified paths and cycles in graphs
• On the distance spread of cacti and bicyclic graphs
• Further results on the least eigenvalue of connected graphs
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• The least eigenvalue of unicyclic graphs with application to spectral spread
• The least eigenvalue of a graph with a given domination number
• Maximum spread of \(K_{2,t}\)-minor-free graphs
• On the maximum spread of planar and outerplanar graphs
• On the least eigenvalue of cacti
• The least eigenvalue of graphs with cut edges
• Least eigenvalue of the connected graphs whose complements are cacti
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• The signless Laplacian spread
• Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
• The least eigenvalues of integral circulant graphs
• Cacti whose spread is maximal
• Title not available (Why is that?)
• A note on connected bipartite graphs of fixed order and size with maximal index
• The least eigenvalue of the complements of trees
• The least eigenvalue of a graph with cut vertices
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
• Minimizing the least eigenvalue of bicyclic graphs with fixed diameter.
• Bound on the least eigenvalue of a graph with cut vertices
• On the spectral spread of bicyclic graphs with given girth

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q999810)