Further results on the least eigenvalue of connected graphs

DOI10.1016/J.LAA.2011.04.030zbMATH Open1222.05174OpenAlexW1989547636MaRDI QIDQ549290FDOQ549290

Authors: Tatjana M. Aleksić, Miroslav Petrović, Slobodan K. Simić 

Publication date: 15 July 2011

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

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

Recommendations

• Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
• Graphs for which the least eigenvalue is minimal. II.
• Graphs for which the least eigenvalue is minimal. I
• Non-bipartite graphs of fixed order and size that minimize the least eigenvalue
• On the least distance eigenvalue and its applications on the distance spread

zbMATH Keywords

spectral spreadthe largest eigenvaluethe least eigenvalue

Mathematics Subject Classification ID

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

Cites Work

• Eigenspaces of graphs
• An introduction to the theory of graph spectra
• Title not available (Why is that?)
• 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
• On the first eigenvalue of bipartite graphs
• Graphs for which the least eigenvalue is minimal. II.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The largest eigenvalue of a graph: A survey
• Bicyclic graphs for which the least eigenvalue is minimum
• Title not available (Why is that?)

Cited In (15)

• On the least eigenvalue of cacti with pendant vertices
• An edge-rotating theorem on the least eigenvalue of graphs
• The least eigenvalue of graphs whose complements are unicyclic
• Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
• Maximize the \(Q\)-index of graphs with fixed order and size
• On the nullity of connected graphs with least eigenvalue at least -2
• The least eigenvalue of graphs with given connectivity
• Least eigenvalue of the connected graphs whose complements are cacti
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• On the Laplacian spectral radius of bipartite graphs with fixed order and size
• Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
• Cacti whose spread is maximal
• A note on connected bipartite graphs of fixed order and size with maximal index
• Graphs with least eigenvalue \(-2\): ten years on
• Bound on the least eigenvalue of a graph with cut vertices

This page was built for publication: Further results on the least eigenvalue of connected graphs

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