The second largest eigenvalue of a tree

From MaRDI portal
Publication:1169482

DOI10.1016/0024-3795(82)90022-2zbMath0495.05044OpenAlexW2066456540MaRDI QIDQ1169482

Arnold Neumaier

Publication date: 1982

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(82)90022-2



Related Items

Some graph mappings that preserve the sign of λ2 - r, On the largest eigenvalues of trees, A study of eigenspaces of graphs, On the spectral radius of graphs with cut edges, Some relations between roots, holes, and pillars, On the largest \(k\)th eigenvalues of trees, On the two largest eigenvalues of trees, Spectral Radius of Graphs, The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\), Bounds on the second largest eigenvalue of a tree with perfect matchings, Connected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1, Null decomposition of trees, Spectral characterization of the complete graph removing a cycle, Sharp upper bounds on the second largest eigenvalues of connected graphs, The non-bipartite graphs with all but two eigenvalues in [–1, 1], Upper bounds on the smallest positive eigenvalue of trees, Bounds on graph eigenvalues, Characterization of outerplanar graphs whose second largest eigenvalue is at most 1, Unnamed Item, On the spectral radius of quasi-tree graphs, Notes on the second largest eigenvalue of a graph, Nullspace vertex partition in graphs, Graphs with least eigenvalue \(-2\): ten years on, Decomposition of Smith graphs in maximal reflexive cacti, Ordering trees by their largest eigenvalues, Eigenvalues of subgraphs of the cube, A \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal time, On bicyclic reflexive graphs, Ordering trees by their largest eigenvalues, On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\), An analogue of the Gallai-Edmonds structure theorem for non-zero roots of the matching polynomial, Multicyclic treelike reflexive graphs, On the spectral radius of trees, The spectral radius of trees on \(k\) pendant vertices, Maximal reflexive cacti with four cycles: The approach via Smith graphs, Trees and acyclic matrices over arbitrary fields, On generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1, On graphs whose second largest eigenvalue is at most 1, Extremal problems involving the two largest complementarity eigenvalues of a graph, The largest eigenvalue of a graph: A survey, On graphs whose signless Laplacian index does not exceed 4.5, Developments in the theory of graph spectra, A Decomposition Theorem for Higher Rank Coxeter Groups, Reflexive line graphs of trees and Salem numbers, The multiplicity of eigenvalues of trees, On graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\), Discrete hyperbolic geometry, The kth largest eigenvalue of a tree, Reflexive line graphs of trees



Cites Work