Notes on the second largest eigenvalue of a graph

DOI10.1016/j.laa.2014.09.032zbMath1302.05112OpenAlexW2042237583MaRDI QIDQ471939

Milica Anđelić, Dejan Živković, Carlos Martins de Fonseca, Slobodan K. Simic

Publication date: 17 November 2014

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

Full work available at URL: https://doi.org/10.1016/j.laa.2014.09.032

zbMATH Keywords

adjacency matrixsecond largest eigenvaluesignless Laplacian

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (4)

Secure fast evaluation of iterative methods: with an application to secure PageRank ⋮ Characterization of outerplanar graphs whose second largest eigenvalue is at most 1 ⋮ Graphs with all but two eigenvalues in \([-2, 0\)] ⋮ Second largest eigenpair statistics for sparse graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete hyperbolic geometry
• The second largest eigenvalue of a tree
• Hyperbolic trees
• Multicyclic treelike reflexive graphs
• The integral 3-harmonic graphs
• More on non-regular bipartite integral graphs with maximum degree 4 not having ±1 as eigenvalues
• A class of reflexive cactuses with four cycles
• On a class of tricyclic reflexive cactuses
• Hermitian Matrices, Eigenvalue Multiplicities, and Eigenvector Components
• Salem Numbers, Pisot Numbers, Mahler Measure, and Graphs

This page was built for publication: Notes on the second largest eigenvalue of a graph