On graphs with three distinct signless Laplacian eigenvalues

DOI10.1080/03081087.2020.1764471zbMath1500.05036OpenAlexW3027657944MaRDI QIDQ5078229

Huiqiu Lin, Xueyi Huang

Publication date: 23 May 2022

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

Full work available at URL: https://doi.org/10.1080/03081087.2020.1764471

zbMATH Keywords

spectral graph theorygraph Laplacians

Mathematics Subject Classification ID

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

Related Items (2)

On the multiplicity of the least signless Laplacian eigenvalue of a graph ⋮ On spectra of distance Randić matrix of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Biregular graphs with three eigenvalues
• Hypercubes are determined by their distance spectra
• On graphs with just three distinct eigenvalues
• On regular graphs with four distinct eigenvalues
• The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
• Graphs whose normalized Laplacian has three eigenvalues
• Combinatorial designs with two singular values. I: Uniform multiplicative designs
• Graphs with four distinct Laplacian eigenvalues
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• On graphs with three distinct Laplacian eigenvalues
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• On the normalized Laplacian energy and general Randić index \(R_{-1}\) of graphs
• Nonregular graphs with three eigenvalues
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• Bipartite graphs with five eigenvalues and pseudo designs
• Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
• A nonregular analogue of conference graphs
• Regular graphs with four eigenvalues
• Interlacing eigenvalues and graphs
• On graphs with distance Laplacian spectral radius of multiplicity \(n-3\)
• The graphs with all but two eigenvalues equal to \(\pm 1\)
• The graphs with all but two eigenvalues equal to \(-2\) or 0
• Graphs with at most one signless Laplacian eigenvalue exceeding three
• A note on graphs whose signless Laplacian has three distinct eigenvalues
• On regular graphs and coronas whose second largest eigenvalue does not exceed 1
• Towards a spectral theory of graphs based on the signless Laplacian, I
• On Graphs with Three or Four Distinct Normalized Laplacian Eigenvalues
• On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
• GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
• On the distance and distance Laplacian eigenvalues of graphs
• Graphs with two main and two plain eigenvalues

This page was built for publication: On graphs with three distinct signless Laplacian eigenvalues