Minimal least eigenvalue of connected graphs of order n and size m = n + k (5 k 8)

DOI10.1007/S11464-019-0805-5MaRDI QIDQ2175476zbMATH OpenOpenAlexFDO

Authors Jiming Guo, Xin Li, Zhi-Wen Wang

Publication date 29 April 2020

Published in Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11464-019-0805-5

zbMATH Keywords

adjacency matrixleast eigenvalue

Mathematics Subject Classification ID

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

Recommendations

• The least eigenvalue of graphs with given connectivity
• Minimizing the least eigenvalue of graphs with fixed order and size
• Non-bipartite graphs of fixed order and size that minimize the least eigenvalue
• Minimally \((n,\lambda)\)-connected graphs of low order and maximal size
• Further results on the least eigenvalue of connected graphs
• Graphs for which the least eigenvalue is minimal. II.
• Graphs for which the least eigenvalue is minimal. I
• The least eigenvalue of a graph with a given domination number
• On graphs whose smallest eigenvalue is at least \(-1-\sqrt 2\)
• The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected

Cites work

• scientific article; zbMATH DE number 3717357 (Why is no real title available?)
• scientific article; zbMATH DE number 2117218 (Why is no real title available?)
• A surprising property of the least eigenvalue of a graph
• An introduction to the theory of graph spectra
• Bicyclic graphs for which the least eigenvalue is minimum
• Further results on the least eigenvalue of connected graphs
• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• On the eigenvalues of trees
• On the first eigenvalue of bipartite graphs
• The least eigenvalue of a graph with cut vertices

Cited in

(7)

• Further results on the least eigenvalue of connected graphs
• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• The least eignvalue of the graphs whose complements are connected and have pendant vertices
• A note on the least eigenvalue of a graph with given maximum degree
• Non-bipartite graphs of fixed order and size that minimize the least eigenvalue
• Bound on the least eigenvalue of a graph with cut vertices

This page was built for publication: Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))

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