文献类型：期刊文献

英文题名：The algebraic connectivity of graphs with given induced matching number

作者：Guo, Ji-Ming[1];Huang, Li-Ting[1];Wang, Zhiwen[1]

机构：[1]East China Univ Sci & Technol, Sch Math, Shanghai, Peoples R China

年份：2025

卷号：44

期号：6

外文期刊名：COMPUTATIONAL & APPLIED MATHEMATICS

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

基金：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).

语种：英文

外文关键词：Graph; Tree; Algebraic connectivity; Induced matching number

摘要：The algebraic connectivity of a graph is the second smallest eigenvalue of its Laplacian matrix. In this paper, we characterize all the extremal graphs with the maximal algebraic connectivity among all graphs with given order and induced matching number. Furthermore, for trees with given induced matching number, the first three values of the maximal algebraic connectivity and the corresponding extremal trees are also determined.