The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

DOI10.1016/j.laa.2010.04.009zbMath1214.05085OpenAlexW2018719923MaRDI QIDQ979013

Ying-Ying Tan, Yi-Zheng Fan

Publication date: 25 June 2010

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

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

zbMATH Keywords

graphadjacency matrixleast eigenvaluevertex (edge) cover numbervertex (edge) independence number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (8)

On the least eigenvalue of cacti with pendant vertices ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ On least eigenvalues of bicyclic graphs with fixed number of pendant vertices ⋮ The least eigenvalue of a graph with a given domination number ⋮ The least eigenvalue of the complements of trees ⋮ Relation between the Hermitian energy of a mixed graph and the matching number of its underlying graph ⋮ The least eigenvalue of graphs whose complements have only two pendent vertices ⋮ The least eigenvalue of graphs whose complements are unicyclic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral radius of graphs with given matching number
• Large matchings from eigenvalues
• Graphs for which the least eigenvalue is minimal. I
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• Eigenvalue bounds for independent sets
• Graphs for which the least eigenvalue is minimal. II.
• The least eigenvalue of a graph with cut vertices
• Bicyclic graphs for which the least eigenvalue is minimum
• The least eigenvalue of graphs with given connectivity
• Matchings in regular graphs from eigenvalues
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• The minimum spectral radius of graphs with a given independence number
• The kth largest eigenvalue of a tree
• Lower bounds on the spectra of symmetric matrices with nonnegative entries
• Spectral bounds for the clique and independence numbers of graphs
• Sharp lower bounds of the least eigenvalue of planar graphs
• Bounds on the \(k\)th eigenvalues of trees and forests
• Eigenvalues and perfect matchings
• Interlacing eigenvalues and graphs
• The largest eigenvalue of a graph: A survey

This page was built for publication: The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph