文献类型：期刊文献

英文题名：Laplacian eigenvalue distribution of a graph with given independence number

作者：Choi, Jinwon[1,2];Suil, O.[3];Park, Jooyeon[4];Wang, Zhiwen[5]

机构：[1]Sookmyung Womens Univ, Dept Math, Seoul 04310, South Korea;[2]Sookmyung Womens Univ, Res Inst Nat Sci, Seoul 04310, South Korea;[3]State Univ New York, Dept Appl Math & Stat, Incheon 21985, South Korea;[4]Sookmyung Womens Univ, Dept Math, Seoul 04310, South Korea;[5]East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China

年份：2023

卷号：448

外文期刊名：APPLIED MATHEMATICS AND COMPUTATION

收录：;EI(收录号：20231013692300);WOS:【SCI-EXPANDED(收录号:WOS:000953767200001)】；

基金：Research supported by NRF-2018R1C1B6005600. Research supported by NRF-2020R1F1A1A01048226, NRF-2021K2A9A2A06044515, and NRF-2021K2A9A2A1110161711. Research supported by NSFC no. 12161141006 and CPSF no. 2021M691671.

语种：英文

外文关键词：Laplacian eigenvalues; Independence number

摘要：For a graph G , let alpha(G) be the independence number of G , let L(G) be the Laplacian matrix of G , and let mGI be the number of eigenvalues of L(G) in the interval I. Ahanjideh, Akbari, Fakharan and Trevisan proved that alpha(G) <= mG[0, n - alpha(G)] if G is an n-vertex connected graph. Choi, Moon and Park characterized graphs with alpha(G) = mG[0, n - alpha(G)] for alpha(G) = 2 and alpha (G) = n - 2 . In this paper, we give a characterization for alpha (G) = 3 and alpha (G) = n - 3 .(c) 2023 Elsevier Inc. All rights reserved.