Graphs for which the least eigenvalue is minimal. I
From MaRDI portal
Publication:927768
DOI10.1016/J.LAA.2008.02.032zbMATH Open1149.05030OpenAlexW4213161202MaRDI QIDQ927768
Francis K. Bell, Dragoš Cvetković, Slobodan K. Simić, P. Rowlinson
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Eigenspaces of graphs
- Bounds on graph eigenvalues
- Recent results in the theory of graph spectra
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- A table of connected graphs on six vertices
- Lower bounds on the spectra of symmetric matrices with nonnegative entries
- The largest eigenvalue of a graph: A survey
- On the maximal index of graphs with a prescribed number of edges
- Graphs with least eigenvalue at least \(-\sqrt3\)
- Variable neighborhood search for extremal graphs. 16. Some conjectures related to the largest eigenvalue of a graph
- On the distribution of eigenvalues of a simple undirected graph
- Sharp lower bounds of the least eigenvalue of planar graphs
- The smallest eigenvalue of \(K_{r}\)-free graphs
Cited In (48)
- Some Minimal Graphs by Interlacing Eigenvalues
- On the least eigenvalue of cacti with pendant vertices
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
- On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
- Combinatorial upper bounds for the smallest eigenvalue of a graph
- On second Zagreb energy 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
- An edge-rotating theorem on the least eigenvalue of graphs
- The least eigenvalue of graphs whose complements are unicyclic
- Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
- Spectral conditions for the existence of specified paths and cycles in graphs
- Further results on the least eigenvalue of connected 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
- Minimizing the least eigenvalue of graphs with fixed order and size
- Chain graph sequences and Laplacian spectra of chain graphs
- On the least eigenvalue of cacti
- Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
- On inverse symmetric division deg index of graphs
- Equilibrium existence and uniqueness in network games with additive preferences
- The least eigenvalue of graphs with cut edges
- Least eigenvalue of the connected graphs whose complements are cacti
- Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
- On the Laplacian spectral radius of bipartite graphs with fixed order and size
- 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
- Minimal least eigenvalue of connected graphs of order \(n\) and size \(m = n + k\) (\(5 \leqslant k \leqslant 8\))
- On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
- A note on connected bipartite graphs of fixed order and size with maximal index
- Graphs with least eigenvalue \(-2\): ten years on
- On the spectral radii and the signless Laplacian spectral radii of c-cyclic graphs with fixed maximum degree
- On bounds for the index of double nested graphs
- The least eigenvalue of the complements of trees
- 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
- Title not available (Why is that?)
- 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
- Bound on the least eigenvalue of a graph with cut vertices
- On the spectral spread of bicyclic graphs with given girth
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)
