Graphs for which the least eigenvalue is minimal. I

From MaRDI portal
Publication:927768

DOI10.1016/j.laa.2008.02.032zbMath1149.05030OpenAlexW4213161202MaRDI QIDQ927768

Francis K. Bell, Peter Rowlinson, Dragos Cvetković, Slobodan K. Simic

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




Related Items (45)

Characterization of the minimizing graph of the connected graphs whose complements are bicyclicAn edge-rotating theorem on the least eigenvalue of graphsEigenvalue location for chain graphsMinimal 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 treesOn the spectral spread of bicyclic graphs with given girthThe least eigenvalue of graphs with cut edgesOn the least eigenvalue of cacti with pendant verticesOn least eigenvalues and least eigenvectors of real symmetric matrices and graphsChain graph sequences and Laplacian spectra of chain graphsBounds on the eigenvalues of graphs with cut vertices or edgesOn inverse symmetric division deg index of graphsConnected signed graphs of fixed order, size, and number of negative edges with maximal indexOn the least distance eigenvalue of a graphEigenvalue location in threshold graphsMinimizing the least eigenvalue of graphs with fixed order and sizeMinimizing graph of the connected graphs whose complements are bicyclic with two cyclesA note on connected bipartite graphs of fixed order and size with maximal indexSome new considerations about double nested graphsGraphs with least eigenvalue \(-2\): ten years onOn least eigenvalues of bicyclic graphs with fixed number of pendant verticesThe least eigenvalue of a graph with a given domination numberEquilibrium existence and uniqueness in network games with additive preferencesMinimizing 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 cactiOn bounds for the index of double nested graphsThe least eigenvalue of the complements of treesOn the Laplacian spectral radius of bipartite graphs with fixed order and sizeThe vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graphOn the spectral radii and the signless Laplacian spectral radii of c-cyclic graphs with fixed maximum degreeBicyclic graphs for which the least eigenvalue is minimumThe least eigenvalue of graphs with given connectivitySome observations on the smallest adjacency eigenvalue of a graphThe smallest positive eigenvalue of graphs under perturbationThe least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant verticesUnnamed ItemThe least eigenvalue of graphs whose complements have only two pendent verticesFast algorithms for computing the characteristic polynomial of threshold and chain graphsNon-bipartite graphs of fixed order and size that minimize the least eigenvalueThe least eigenvalue of graphs whose complements are unicyclicLeast eigenvalue of the connected graphs whose complements are cacti



Cites Work


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