Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread

From MaRDI portal
Publication:929482

DOI10.1016/j.laa.2008.03.012zbMath1143.05053OpenAlexW1980336872MaRDI QIDQ929482

Yu-Bin Gao, Yi Wang, Yi-Zheng Fan

Publication date: 17 June 2008

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

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




Related Items (42)

A lower bound for the algebraic connectivity of a graph in terms of the domination numberAn edge-rotating theorem on the least eigenvalue of graphs\(A_\alpha\)-spectrum of a firefly graphThe Laplacian spread of unicyclic graphsMinimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))On the spectral spread of bicyclic graphs with given girthThe least eigenvalue of graphs with cut edgesThe eccentricity spread of weak-friendship graphsOrdering unicyclic graphs in terms of their smaller least eigenvaluesOn the least eigenvalue of cacti with pendant verticesMinimal spread of integral circulant graphsThe least eigenvalue of signless Laplacian of graphs under perturbationMaximum spread of \(K_{2,t}\)-minor-free graphsBounds on the eigenvalues of graphs with cut vertices or edgesThe \(A_\alpha\)-spread of a graphGraph Limits and Spectral Extremal Problems for GraphsMinimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant verticesThe Laplacian spread of quasi-tree graphsOn the least distance eigenvalue of a graphCacti whose spread is maximalMaximizing the least signless Laplacian eigenvalue of unicyclic graphsSpectral properties of a class of unicyclic graphsOn least eigenvalues of bicyclic graphs with fixed number of pendant verticesThe least eigenvalue of a graph with a given domination numberMinimizing the least eigenvalue of unicyclic graphs with fixed diameterBound on the least eigenvalue of a graph with cut verticesSpectral conditions for the existence of specified paths and cycles in graphsThe least eigenvalue of a graph with cut verticesFurther results on the least eigenvalue of connected graphsOn the least eigenvalue of cactiThe least eigenvalue of the complements of treesThe vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graphOn the largest eigenvalue of signed unicyclic graphsBicyclic graphs for which the least eigenvalue is minimumThe least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant verticesUnnamed ItemLeast H-eigenvalue of adjacency tensor of hypergraphs with cut verticesSpectra of signed graphsThe signless Laplacian spreadThe least eigenvalue of graphs whose complements have only two pendent verticesMaximizing the largest eigenvalues of signed unicyclic graphsThe least eigenvalue of graphs whose complements are unicyclic



Cites Work


This page was built for publication: Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread