Classification of graphs by Laplacian eigenvalue distribution and independence number
Citations

WEB OF SCIENCE

3
Citations

SCOPUS

3

초록

Let (Formula presented.) denote the number of Laplacian eigenvalues of a graph G in an interval I and let (Formula presented.) denote the independence number of G. In this paper, we determine the classes of graphs that satisfy the condition (Formula presented.) when (Formula presented.) and (Formula presented.), where n is the order of G. When (Formula presented.), (Formula presented.) for some (Formula presented.). When (Formula presented.), there are two types of graphs (Formula presented.) and (Formula presented.) of order n = p + q + r + 2, which we call the binary star graphs. Also, we show that the binary star graphs with p = r are determined by their Laplacian spectra.

키워드

independence numberL-cospectralLaplacian eigenvalue
제목
Classification of graphs by Laplacian eigenvalue distribution and independence number
저자
Choi, JinwonMoon, SunyoPark, Seungkook
DOI
10.1080/03081087.2022.2124944
발행일
2023-12
저널명
Linear and Multilinear Algebra
71
18
페이지
2877 ~ 2893