Characterization of graphs with some normalized Laplacian eigenvalue of multiplicity n - 3

DOI10.1016/J.LAA.2020.07.027zbMATH Open1447.05128arXiv1912.13227OpenAlexW3044296837MaRDI QIDQ2199348FDOQ2199348

Sai Wang, Fenglei Tian, Dein Wong

Publication date: 16 September 2020

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

Abstract: Graphs with few distinct eigenvalues have been investigated extensively. In this paper, we focus on another relevant topic: characterizing graphs with some eigenvalue of large multiplicity. Specifically, the normalized Laplacian matrix of a graph is considered here. Let $h{o}_{n-1}(G)$ and $u(G)$ be the second least normalized Laplacian eigenvalue and the independence number of a graph $G$, respectively. As the main conclusions, two families of $n$-vertex connected graphs with some normalized Laplacian eigenvalue of multiplicity $n-3$ are determined: graphs with $h{o}_{n-1}(G)=-1$ and graphs with $h{o}_{n-1}(G)eq-1$ and $u(G)eq2$. Moreover, it is proved that these graphs are determined by their spectrum.

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

zbMATH Keywords

eigenvalue multiplicitynormalized Laplacian eigenvaluesnormalized Laplacian matrix

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Spectra of graphs
• Which graphs are determined by their spectrum?
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• Bounds on normalized Laplacian eigenvalues of graphs
• Nonregular graphs with three eigenvalues
• On graphs with three eigenvalues
• Biregular graphs with three eigenvalues
• On graphs with just three distinct eigenvalues
• Graphs with many valencies and few eigenvalues
• Graphs whose normalized Laplacian has three eigenvalues
• On graphs with three distinct Laplacian eigenvalues
• Graphs with four distinct Laplacian eigenvalues
• Graphs with three eigenvalues and second largest eigenvalue at most 1
• Small regular graphs with four eigenvalues
• Regular graphs with four eigenvalues
• On regular graphs with four distinct eigenvalues
• On Graphs with Three or Four Distinct Normalized Laplacian Eigenvalues
• GRAPHS WITH A SMALL NUMBER OF DISTINCT EIGENVALUES
• A note on graphs whose signless Laplacian has three distinct eigenvalues
• Universal adjacency matrices with two eigenvalues
• Normalized Laplacian eigenvalues and energy of trees
• Trees with 4 or 5 distinct normalized Laplacian eigenvalues

Cited In (6)

• Full characterization of graphs having certain normalized Laplacian eigenvalue of multiplicity \(n-3\)
• Graphs whose normalized Laplacian has three eigenvalues
• On the multiplicity of the least signless Laplacian eigenvalue of a graph
• On the multiplicities of normalized Laplacian eigenvalues of graphs
• Independence number and the normalized Laplacian eigenvalue one
• The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5

This page was built for publication: Characterization of graphs with some 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 Q2199348)