Graphs with four distinct Laplacian eigenvalues
From MaRDI portal
Publication:644702
DOI10.1007/s10801-011-0287-3zbMath1242.05166OpenAlexW2065676743MaRDI QIDQ644702
B. Tayfeh-Rezaie, Ali Mohammadian
Publication date: 7 November 2011
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10801-011-0287-3
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Related Items (17)
Some results on the Laplacian spread of a graph ⋮ Seidel spectrum of threshold graphs ⋮ Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ On the multiplicity of the least signless Laplacian eigenvalue of a graph ⋮ On graphs with three distinct signless Laplacian eigenvalues ⋮ On the multiplicities of distance Laplacian eigenvalues ⋮ Complete characterization of the bidegreed split graphs with three or four distinct \(A_{\alpha}\)-eigenvalues ⋮ Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\) ⋮ On split graphs with three or four distinct (normalized) Laplacian eigenvalues ⋮ Trees with Four and Five Distinct Signless Laplacian Eigenvalues ⋮ On Laplacian energy in terms of graph invariants ⋮ On graphs with distance Laplacian spectral radius of multiplicity \(n-3\) ⋮ Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\) ⋮ Unnamed Item ⋮ Monotonic normalized heat diffusion for regular bipartite graphs with four eigenvalues ⋮ Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues ⋮ Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs
Cites Work
- Unnamed Item
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- On graphs with three distinct Laplacian eigenvalues
- A lower bound for the Laplacian eigenvalues of a graph-proof of a conjecture by Guo
- Multiplicative cones - a family of three eigenvalue graphs
- Nonregular graphs with three eigenvalues
- Laplacian graph eigenvectors
- Graphs with constant \(\mu\) and \(\overline{\mu}\)
- An improved upper bound for Laplacian graph eigenvalues
- On graphs with three eigenvalues
- Small regular graphs with four eigenvalues
- Combinatorial designs with two singular values. II: Partial geometric designs
- A nonregular analogue of conference graphs
- Regular graphs with four eigenvalues
- A sharp upper bound for the number of spanning trees of a graph
- On graphs with equal algebraic and vertex connectivity
This page was built for publication: Graphs with four distinct Laplacian eigenvalues
