A relation between multiplicity of 1 as a Laplacian eigenvalue and induced matching numbers in trees

被引：0
|
作者：
Wang, Zhiwen [1 ]
Chen, Qian-Qian [1 ]
Guo, Ji-Ming [1 ]
Li, Xiao-Meng [1 ]
机构：
[1] East China Univ Sci & Technol, Sch Math, Shanghai, Peoples R China
来源：
DISCRETE MATHEMATICS | 2025年 / 348卷 / 05期
基金：
中国国家自然科学基金;
关键词：
Laplacian eigenvalue; Tree; Multiplicity; Induced matching number;
D O I：
10.1016/j.disc.2025.114401
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The induced matching number of a graph is the largest number of edges at pairwise distance at least 2. Let T be a tree of order n with induced matching number /3'(T). In this paper, we give a sharp upper bound in terms of nand /3'(T) for the multiplicity of 1 as a Laplacian eigenvalue of T. Moreover, we characterize the extremal graphs. (c) 2025 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页数：8
相关论文
共 33 条
1234