Matching extension and distance spectral radius

被引：4

作者：

Zhang, Yuke ^{[1
,2
]}

van Dam, Edwin R. ^{[2
]}

机构：

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

[2] Tilburg Univ, Dept Econometr & OR, Tilburg, Netherlands

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2023年 / 674卷

关键词：

Distance spectral radius; Matching; Extendability; GRAPHS; TOUGHNESS;

D O I：

10.1016/j.laa.2023.06.002

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A graph is called k-extendable if each k-matching can be ex-tended to a perfect matching. We give spectral conditions for the k-extendability of graphs and bipartite graphs using Tutte-type and Hall-type structural characterizations. Con-cretely, we give a sufficient condition in terms of the spectral radius of the distance matrix for the k-extendability of a graph and completely characterize the corresponding extremal graphs. A similar result is obtained for bipartite graphs.& COPY; 2023 Elsevier Inc. All rights reserved.

引用

页码：244 / 255

页数：12