On the multiplicity of the least signless Laplacian eigenvalue of a graph

DOI10.1016/J.DISC.2022.112940MaRDI QIDQ2144486zbMATH OpenOpenAlexFDO

Authors Fenglei Tian, Dein Wong, Shu-Guang Guo

Publication date 14 June 2022

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2022.112940

zbMATH Keywords

eigenvalue multiplicityleast signless Laplacian eigenvaluesignless Laplacian matrix

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Review text

Given an \(n\)-vertex connected simple graph \(G,\) let \(A(G),\, D(G)\) be the adjacency matrix and degree diagonal matrix of \(G\), respectively. Then \(Q(G)=D(G)+A(G)\) is the well-known signless Laplacian matrix of \(G\). The eigenvalues of \(Q(G)\) are called the \(Q\)-eigenvalues of \(G\). In this paper, the authors study the multiplicity of the smallest \(Q\)-eigenvalues of \(G\) and identify all the \(n\)-vertex connected graphs with the smallest \(Q\)-eigenvalues of multiplicity \(n-3\). Furthermore, they show that all these graphs are determined by their signless Laplacian spectra. It is a nice paper.

Recommendations

• On the multiplicity of distance signless Laplacian eigenvalues of graphs
• On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
• On graphs with exactly three Q-eigenvalues at least two
• On the least signless Laplacian eigenvalue of a non-bipartite connected graph with fixed maximum degree
• scientific article; zbMATH DE number 6612432

Cites work

• A characterization of the smallest eigenvalue of a graph
• A note on graphs whose signless Laplacian has three distinct eigenvalues
• Biregular graphs with three eigenvalues
• Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
• Graphs whose normalized Laplacian has three eigenvalues
• GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• Graphs with four distinct Laplacian eigenvalues
• Graphs with many valencies and few eigenvalues
• Graphs with some distance Laplacian eigenvalue of multiplicity \(n-3\)
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• scientific article; zbMATH DE number 3215568 (Why is no real title available?)
• Hypercubes are determined by their distance spectra
• Nonregular graphs with three eigenvalues
• On conjectures involving second largest signless Laplacian eigenvalue of graphs
• On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
• On graphs with distance Laplacian spectral radius of multiplicity \(n-3\)
• On graphs with just three distinct eigenvalues
• On graphs with three distinct Laplacian eigenvalues
• On graphs with three distinct signless Laplacian eigenvalues
• On graphs with three eigenvalues
• On graphs with three or four distinct normalized Laplacian eigenvalues
• On regular graphs with four distinct eigenvalues
• On the \(A_\alpha\)-spectra of graphs
• On the multiplicities of normalized Laplacian eigenvalues of graphs
• On the multiplicity of distance signless Laplacian eigenvalues of graphs
• On the second largest eigenvalue of the signless Laplacian
• Signless Laplacians of finite graphs
• Spectra of graphs
• The smallest eigenvalue of the signless Laplacian

Cited in

(12)

• A sharp lower bound on the least signless Laplacian eigenvalue of a graph
• On graphs with exactly three Q-eigenvalues at least two
• On the Faria's inequality for the Laplacian and signless Laplacian spectra: a unified approach
• Topological multiplicity of the maximum eigenvalue of graph \(1\)-Laplacian
• scientific article; zbMATH DE number 6612432 (Why is no real title available?)
• A note on graphs whose signless Laplacian has three distinct eigenvalues
• On the multiplicity of laplacian eigenvalues of graphs
• On graphs whose smallest distance (signless Laplacian) eigenvalue has large multiplicity
• The smallest eigenvalue of the signless Laplacian
• Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching
• Improved upper bound of multiplicity of (signless) Laplacian eigenvalue two
• Signless Laplacian spectral characterization of structural modifications of complete and complete bipartite graphs

This page was built for publication: On the multiplicity of the least signless Laplacian eigenvalue of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144486)