Minimizing the least eigenvalue of unicyclic graphs with fixed diameter

DOI10.1016/j.disc.2009.09.017zbMath1216.05081OpenAlexW2091941189MaRDI QIDQ965979

Ming-qing Zhai, Jin-Long Shu, Rui-fang Liu

Publication date: 27 April 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.09.017

zbMATH Keywords

diameterunicyclic graphleast eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (10)

Computing unique maximum matchings in \(O(m)\) time for König-Egerváry graphs and unicyclic graphs ⋮ Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) ⋮ On the least eigenvalue of cacti with pendant vertices ⋮ The minimum Wiener index of unicyclic graphs with a fixed diameter ⋮ Maximizing the least signless Laplacian eigenvalue of unicyclic graphs ⋮ Spectral properties of a class of unicyclic graphs ⋮ On least eigenvalues of bicyclic graphs with fixed number of pendant vertices ⋮ Bound on the least eigenvalue of a graph with cut vertices ⋮ Signless Laplacian spectral radii of graphs with given chromatic number ⋮ On the intersection of all critical sets of a unicyclic graph

Cites Work

• Unnamed Item
• Unnamed Item
• On the spectral radius of unicyclic graphs with fixed diameter
• 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.
• On the spectral radius of bipartite graphs with given diameter
• Sharp lower bounds of the least eigenvalue of planar graphs

This page was built for publication: Minimizing the least eigenvalue of unicyclic graphs with fixed diameter