The least eigenvalue of the complements of trees

DOI10.1016/j.laa.2011.04.011zbMath1222.05156MaRDI QIDQ551342

Fei-Fei Zhang, Yi-Zheng Fan, Yi Wang

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.011

zbMATH Keywords

tree; adjacency matrix; least eigenvalue; complement

Mathematics Subject Classification ID

05D05: Extremal set theory

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

15A18: Eigenvalues, singular values, and eigenvectors

Related Items

Unnamed Item, Minimizing graph of the connected graphs whose complements are bicyclic with two cycles, Bound on the least eigenvalue of a graph with cut vertices, The distance spectrum of the complements of graphs of diameter greater than three, The distance spectrum of the complements of graphs with two pendent vertices, Extremal problems for the eccentricity matrices of complements of trees, Graphs with least eigenvalue \(-2\): ten years on, On the second minimum algebraic connectivity of the graphs whose complements are trees, The least algebraic connectivity of graphs, On the least eigenvalue of cacti with pendant vertices, On least eigenvalues and least eigenvectors of real symmetric matrices and graphs, The distance spectrum of complements of trees, Least eigenvalue of the connected graphs whose complements are cacti, On the second minimizing graph in the set of complements of trees, Spectral properties of the eccentricity matrix of graphs, Energy and inertia of the eccentricity matrix of coalescence of 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, The determination on weight hierarchies of \(q\)-ary linear codes of dimension 5 in class IV

Cites Work

• Graphs for which the least eigenvalue is minimal. I
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• Graphs for which the least eigenvalue is minimal. II.
• 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
• Bicyclic graphs for which the least eigenvalue is minimum
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• On the spectral radius of (0,1)-matrices
• Sharp lower bounds of the least eigenvalue of planar graphs
• The largest eigenvalue of a graph: A survey
• Graphs with least eigenvalue \(-2\): The star complement technique
• Unnamed Item
• Unnamed Item