文献类型：期刊文献

英文题名：A relation between multiplicity of 1 as a Laplacian eigenvalue and induced matching numbers in trees

作者：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

年份：2025

卷号：348

期号：5

外文期刊名：DISCRETE MATHEMATICS

收录：;WOS:【SCI-EXPANDED(收录号:WOS:001420451900001)】；

基金：star This work is supported by National Natural Science Foundation of China (Nos. 12171154, 12301438) , Chenguang Program of Shanghai Education Development Foundation and Shanghai Municipal Education Commission (No. 23CGA37) and Youth Innovation Team Project of Shandong Province Universities (No. 2023KJ353) .

语种：英文

外文关键词：Laplacian eigenvalue; Tree; Multiplicity; Induced matching number

摘要：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.