The least eigenvalue of graphs

DOI10.3770/J.ISSN:2095-2651.2012.06.004MaRDI QIDQ4926545zbMATH OpenFDO

Authors Guidong Yu, Yizheng Fan, Yi Wang

Publication date 20 June 2013

zbMATH Keywords

graphadjacency matrixleast eigenvaluecomplement

Mathematics Subject Classification ID

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

Recommendations

• The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected
• The least eignvalue of the graphs whose complements are connected and have pendant vertices
• On the least eigenvalue of graphs with matching number two
• Graphs for which the least eigenvalue is minimal. II.
• The least eigenvalue of graphs whose complements have only two pendent vertices

Cited in

(25)

• On the least eigenvalue of graphs with matching number two
• The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected
• An edge-rotating theorem on the least eigenvalue of graphs
• The least eigenvalue of graphs whose complements have only two pendent vertices
• The chromatic number and the least eigenvalue of a graph
• Graphs for which the least eigenvalue is minimal. I
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of a graph with a given domination number
• Minimizing the least eigenvalue of graphs with fixed order and size
• Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
• Minimum number of distinct eigenvalues of graphs
• Graphs for which the least eigenvalue is minimal. II.
• On the least eigenvalue of graphs with cut vertices
• The least eignvalue of the graphs whose complements are connected and have pendant vertices
• On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
• The least algebraic connectivity of graphs
• scientific article; zbMATH DE number 95308 (Why is no real title available?)
• A note on the least eigenvalue of a graph with given maximum degree
• On the second minimum algebraic connectivity of the graphs whose complements are trees
• The least eigenvalue of the complements of trees
• The least eigenvalue of the signless Laplacian of the complements of trees
• Non-bipartite graphs of fixed order and size that minimize the least eigenvalue
• 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
• Bound on the least eigenvalue of a graph with cut vertices

This page was built for publication: The least eigenvalue of graphs

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