The second largest eigenvalue of a tree

From MaRDI portal
Revision as of 04:59, 31 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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 (49)

Some graph mappings that preserve the sign of λ2 - rOn the largest eigenvalues of treesA study of eigenspaces of graphsOn the spectral radius of graphs with cut edgesSome relations between roots, holes, and pillarsOn the largest \(k\)th eigenvalues of treesOn the two largest eigenvalues of treesSpectral Radius of GraphsThe graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)Bounds on the second largest eigenvalue of a tree with perfect matchingsConnected \((K_4 - e)\)-free graphs whose second largest eigenvalue does not exceed 1Null decomposition of treesSpectral characterization of the complete graph removing a cycleSharp upper bounds on the second largest eigenvalues of connected graphsThe non-bipartite graphs with all but two eigenvalues in [–1, 1] ⋮ Upper bounds on the smallest positive eigenvalue of treesBounds on graph eigenvaluesCharacterization of outerplanar graphs whose second largest eigenvalue is at most 1Unnamed ItemOn the spectral radius of quasi-tree graphsNotes on the second largest eigenvalue of a graphNullspace vertex partition in graphsGraphs with least eigenvalue \(-2\): ten years onDecomposition of Smith graphs in maximal reflexive cactiOrdering trees by their largest eigenvaluesEigenvalues of subgraphs of the cubeA \(\{-1,0,1\}\)- and sparsest basis for the null space of a forest in optimal timeOn bicyclic reflexive graphsOrdering trees by their largest eigenvaluesOn 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 polynomialMulticyclic treelike reflexive graphsOn the spectral radius of treesThe spectral radius of trees on \(k\) pendant verticesMaximal reflexive cacti with four cycles: The approach via Smith graphsTrees and acyclic matrices over arbitrary fieldsOn generalized \(\theta \)-graphs whose second largest eigenvalue does not exceed 1On graphs whose second largest eigenvalue is at most 1Extremal problems involving the two largest complementarity eigenvalues of a graphThe largest eigenvalue of a graph: A surveyOn graphs whose signless Laplacian index does not exceed 4.5Developments in the theory of graph spectraA Decomposition Theorem for Higher Rank Coxeter GroupsReflexive line graphs of trees and Salem numbersThe multiplicity of eigenvalues of treesOn graphs whose second largest eigenvalue does not exceed \((\sqrt {5}-1)/2\)Discrete hyperbolic geometryThe kth largest eigenvalue of a treeReflexive line graphs of trees



Cites Work


This page was built for publication: The second largest eigenvalue of a tree