Graphs for which the least eigenvalue is minimal. II.
From MaRDI portal
Publication:947681
DOI10.1016/j.laa.2008.06.018zbMath1144.05313OpenAlexW2152846270MaRDI QIDQ947681
Dragos Cvetković, Francis K. Bell, Slobodan K. Simic, Peter Rowlinson
Publication date: 6 October 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.06.018
Related Items (44)
Characterization of the minimizing graph of the connected graphs whose complements are bicyclic ⋮ Eigenvalue location for chain graphs ⋮ The bounds of the energy and Laplacian energy of chain graphs ⋮ Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\)) ⋮ On the second minimizing graph in the set of complements of trees ⋮ The least eigenvalue of graphs with cut edges ⋮ Some Properties of Chain and Threshold Graphs ⋮ On the least eigenvalue of cacti with pendant vertices ⋮ On 4-Sachs optimal graphs ⋮ Chain graphs with simple Laplacian eigenvalues and their Laplacian dynamics ⋮ Bounds on the eigenvalues of graphs with cut vertices or edges ⋮ Connected signed graphs of fixed order, size, and number of negative edges with maximal index ⋮ On the least distance eigenvalue of a graph ⋮ Minimizing graph of the connected graphs whose complements are bicyclic with two cycles ⋮ A note on connected bipartite graphs of fixed order and size with maximal index ⋮ Some new considerations about double nested graphs ⋮ Maximize the \(Q\)-index of graphs with fixed order and size ⋮ On least eigenvalues of bicyclic graphs with fixed number of pendant vertices ⋮ The least eigenvalue of a graph with a given domination number ⋮ Minimizing the least eigenvalue of unicyclic graphs with fixed diameter ⋮ The spectrum of semi-Cayley graphs over abelian groups ⋮ Bound on the least eigenvalue of a graph with cut vertices ⋮ Spectral conditions for the existence of specified paths and cycles in graphs ⋮ The least eigenvalue of a graph with cut vertices ⋮ Further results on the least eigenvalue of connected graphs ⋮ On the least eigenvalue of cacti ⋮ On bounds for the index of double nested graphs ⋮ The least eigenvalue of the complements of trees ⋮ On the Laplacian spectral radii of bipartite graphs ⋮ On the Laplacian spectral radius of bipartite graphs with fixed order and size ⋮ The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph ⋮ The least eigenvalue of graphs with given connectivity ⋮ Some observations on the smallest adjacency eigenvalue of a graph ⋮ On main eigenvalues of chain graphs ⋮ The smallest positive eigenvalue of graphs under perturbation ⋮ The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices ⋮ Unnamed Item ⋮ Vertex types in threshold and chain graphs ⋮ The least eigenvalue of graphs whose complements have only two pendent vertices ⋮ Fast algorithms for computing the characteristic polynomial of threshold and chain graphs ⋮ Non-bipartite graphs of fixed order and size that minimize the least eigenvalue ⋮ The least eigenvalue of graphs whose complements are unicyclic ⋮ Least eigenvalue of the connected graphs whose complements are cacti ⋮ On bipartite graphs having minimum fourth adjacency coefficient
Cites Work
This page was built for publication: Graphs for which the least eigenvalue is minimal. II.
