Full characterization of graphs having certain normalized Laplacian eigenvalue of multiplicity n-3

DOI10.1016/J.LAA.2021.07.024MaRDI QIDQ820993zbMATH OpenOpenAlexFDO

Authors Fenglei Tian, Yiju Wang

Publication date 29 September 2021

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

Full work available at URL https://arxiv.org/abs/2012.11929

zbMATH Keywords

spectral graph theoryeigenvalue multiplicitynormalised Laplacian spectrum

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Abstract: Let $G$ be a connected simple graph of order $n$. Let $h{o}_1(G)geqh{o}_2(G)geqcdotsgeqh{o}_{n-1}(G)>h{o}_n(G)=0$ be the eigenvalues of the normalized Laplacian matrix $mathcalL(G)$ of $G$. Denote by $m(h{o}_i)$ the multiplicity of the normalized Laplacian eigenvalue $h{o}_i$. Let $u(G)$ be the independence number of $G$. In this paper, we give a full characterization of graphs with some normalized Laplacian eigenvalue of multiplicity $n-3$, which answers a remaining problem in [S. Sun, K.C. Das, On the multiplicities of normalized Laplacian eigenvalues of graphs, Linear Algebra Appl. 609 (2021) 365-385], $i.e.,$ there is no graph with $m(h{o}_1)=n-3$ ($ngeq6$) and $u(G)=2$. Moreover, we confirm that all the graphs with $m(h{o}_1)=n-3$ are determined by their normalized Laplacian spectra.

Recommendations

• Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
• On the multiplicities of normalized Laplacian eigenvalues of graphs
• Independence number and the normalized Laplacian eigenvalue one
• On graphs with three or four distinct normalized Laplacian eigenvalues
• Normalized Laplacian eigenvalues with chromatic number and independence number of graphs

Cites work

• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• Bounds on normalized Laplacian eigenvalues of graphs
• Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
• Graphs whose normalized Laplacian has three eigenvalues
• Normalized Laplacian spectrum of complete multipartite graphs
• On graphs with three or four distinct normalized Laplacian eigenvalues
• On the multiplicities of normalized Laplacian eigenvalues of graphs
• On the second largest normalized Laplacian eigenvalue of graphs
• The largest normalized Laplacian spectral radius of non-bipartite graphs
• Trees with 4 or 5 distinct normalized Laplacian eigenvalues

Cited in

(9)

• The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
• Laplacian eigenvalue distribution of a graph with given independence number
• Graphs whose normalized Laplacian has three eigenvalues
• On the multiplicities of normalized Laplacian eigenvalues of graphs
• Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity \(n - 3\)
• Characterization of graphs with the limited normalized algebraic connectivity
• Independence number and the normalized Laplacian eigenvalue one
• On graphs with three or four distinct normalized Laplacian eigenvalues
• Normalized Laplacian eigenvalues with chromatic number and independence number of graphs

This page was built for publication: Full characterization of graphs having certain normalized Laplacian eigenvalue of multiplicity \(n-3\)

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