Sharp lower bounds of the least eigenvalue of planar graphs
From MaRDI portal
Publication:1124943
DOI10.1016/S0024-3795(99)00129-9zbMath0929.05057MaRDI QIDQ1124943
Publication date: 29 November 1999
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (20)
Characterization of the minimizing graph of the connected graphs whose complements are bicyclic ⋮ Extreme eigenfunctions of adjacency matrices for planar graphs employed in spatial analyses ⋮ Unnamed Item ⋮ On the second minimizing graph in the set of complements of trees ⋮ The least eigenvalue of graphs with cut edges ⋮ Ordering unicyclic graphs in terms of their smaller least eigenvalues ⋮ On the least eigenvalue of cacti with pendant vertices ⋮ Tree-width, clique-minors, and eigenvalues. ⋮ Unnamed Item ⋮ Graphs for which the least eigenvalue is minimal. I ⋮ Minimizing graph of the connected graphs whose complements are bicyclic with two cycles ⋮ On least eigenvalues of bicyclic graphs with fixed number of pendant vertices ⋮ Minimizing the least eigenvalue of unicyclic graphs with fixed diameter ⋮ The least eigenvalue of a graph with cut vertices ⋮ The least eigenvalue of the complements of trees ⋮ The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph ⋮ The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices ⋮ Bounds of eigenvalues of \(K_{3,3}\)-minor free graphs ⋮ The least eigenvalue of graphs whose complements are unicyclic ⋮ Least eigenvalue of the connected graphs whose complements are cacti
This page was built for publication: Sharp lower bounds of the least eigenvalue of planar graphs
