Graphs for which the least eigenvalue is minimal. I

DOI10.1016/J.LAA.2008.02.032MaRDI QIDQ927768zbMATH OpenOpenAlexFDO

Authors Francis K. Bell, P. Rowlinson, Dragoš Cvetković, Slobodan K. Simić

Publication date 9 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.02.032

zbMATH Keywords

graph spectrumlargest eigenvalueleast eigenvaluenested split graph

Mathematics Subject Classification ID

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

Recommendations

• Graphs for which the least eigenvalue is minimal. II.
• Non-bipartite graphs of fixed order and size that minimize the least eigenvalue
• Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
• The least eigenvalue of graphs
• Minimizing the least eigenvalue of graphs with fixed order and size

Cites work

• scientific article; zbMATH DE number 3695248 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• scientific article; zbMATH DE number 2117218 (Why is no real title available?)
• scientific article; zbMATH DE number 3349875 (Why is no real title available?)
• A table of connected graphs on six vertices
• Bounds on graph eigenvalues
• Eigenspaces of graphs
• Graphs with least eigenvalue at least -3
• Lower bounds on the spectra of symmetric matrices with nonnegative entries
• On the distribution of eigenvalues of a simple undirected graph
• On the maximal index of graphs with a prescribed number of edges
• Recent results in the theory of graph spectra
• Sharp lower bounds of the least eigenvalue of planar graphs
• Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
• The largest eigenvalue of a graph: A survey
• The smallest eigenvalue of \(K_{r}\)-free graphs
• Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph

Cited in

(54)

• Some Minimal Graphs by Interlacing Eigenvalues
• On the least eigenvalue of cacti with pendant vertices
• On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
• Connected signed graphs of fixed order, size, and number of negative edges with maximal index
• Combinatorial upper bounds for the smallest eigenvalue of a graph
• On second Zagreb energy of graphs
• An edge-rotating theorem on the least eigenvalue of graphs
• The least eigenvalue of graphs whose complements have only two pendent vertices
• On the second minimizing graph in the set of complements of trees
• The least eigenvalue of graphs whose complements are unicyclic
• Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
• Further results on the least eigenvalue of connected graphs
• Spectral conditions for the existence of specified paths and cycles in graphs
• On the eigenvalues of firefly graphs
• Eigenvalue location for chain graphs
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of a graph with a given domination number
• Some new considerations about double nested graphs
• Some observations on the smallest adjacency eigenvalue of a graph
• Spectral properties of \(\mathcal{C}\)-graphs
• Minimizing the least eigenvalue of graphs with fixed order and size
• Sharp bounds on the least eigenvalue of a graph determined from edge clique partitions
• scientific article; zbMATH DE number 4112640 (Why is no real title available?)
• Chain graph sequences and Laplacian spectra of chain graphs
• On the least eigenvalue of cacti
• Graphs for which the least eigenvalue is minimal. II.
• Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
• On the least eigenvalue of graphs with cut vertices
• Equilibrium existence and uniqueness in network games with additive preferences
• On inverse symmetric division deg index of graphs
• The least eigenvalue of graphs with cut edges
• Least eigenvalue of the connected graphs whose complements are cacti
• On the Laplacian spectral radius of bipartite graphs with fixed order and size
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• Bounds on the eigenvalues of graphs with cut vertices or edges
• On the least distance eigenvalue of a graph
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
• On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
• Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
• A note on connected bipartite graphs of fixed order and size with maximal index
• Graphs with least eigenvalue -2: ten years on
• On bounds for the index of double nested graphs
• The least eigenvalue of the complements of trees
• On the spectral radii and the signless Laplacian spectral radii of c-cyclic graphs with fixed maximum degree
• Balaban index of bicyclic chain graphs
• Eigenvalue location in threshold graphs
• Non-bipartite graphs of fixed order and size that minimize the least eigenvalue
• Bicyclic graphs for which the least eigenvalue is minimum
• 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
• The smallest positive eigenvalue of graphs under perturbation
• On the spectral spread of bicyclic graphs with given girth
• Bound on the least eigenvalue of a graph with cut vertices

This page was built for publication: Graphs for which the least eigenvalue is minimal. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q927768)