On the spectral characterization of graphs with respect to the normalized Laplacian
Citations

WEB OF SCIENCE

0
Citations

SCOPUS

0

초록

A graph G is said to be determined by its normalized Laplacian spectrum if there is no other non-isomorphic graph with the same normalized Laplacian spectrum. To date, only a limited number of graphs have been proven to possess this property. In this paper, we obtain a new class of graphs that are determined by their normalized Laplacian spectra. Our approach is based on a characterization of all connected n-vertex graphs whose third smallest normalized Laplacian eigenvalue is at least n n-1 . (c) 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.

키워드

Normalized Laplacian spectrumThe third smallest eigenvalueSpectral characterizationEIGENVALUESFAMILY
제목
On the spectral characterization of graphs with respect to the normalized Laplacian
저자
Sun, ShaoweiSun, XiaDas, Kinkar Chandra
DOI
10.1016/j.disc.2026.115034
발행일
2026-06
유형
Article
저널명
Discrete Mathematics
349
6