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
关键词
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
相关论文
共 31 条
[1]   Matching extension and minimum degree [J].
Ananchuen, N ;
Caccetta, L .
DISCRETE MATHEMATICS, 1997, 170 (1-3) :1-13
[2]   Distance spectra of graphs: A survey [J].
Aouchiche, Mustapha ;
Hansen, Pierre .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 458 :301-386
[3]   Eigenvalues and perfect matchings [J].
Brouwer, AE ;
Haemers, WH .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2005, 395 :155-162
[4]  
Brouwer AE, 2012, UNIVERSITEXT, P1, DOI 10.1007/978-1-4614-1939-6
[5]   BINDING NUMBER AND TOUGHNESS FOR MATCHING EXTENSION [J].
CHEN, CP .
DISCRETE MATHEMATICS, 1995, 146 (1-3) :303-306
[6]   THE MATCHING EXTENDIBILITY OF SURFACES [J].
DEAN, N .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1992, 54 (01) :133-141
[7]  
Fan DD, 2022, Arxiv, DOI arXiv:2211.09304
[8]  
Favaron O., 1996, Discuss. Math. Graph Theory, V16, P41, DOI 10.7151 dmgt.1022 // / /
[9]   Spectral radius of graphs with given matching number [J].
Feng, Lihua ;
Yu, Guihai ;
Zhang, Xiao-Dong .
LINEAR ALGEBRA AND ITS APPLICATIONS, 2007, 422 (01) :133-138
[10]   ADDRESSING PROBLEM FOR LOOP SWITCHING [J].
GRAHAM, RL ;
POLLAK, HO .
BELL SYSTEM TECHNICAL JOURNAL, 1971, 50 (08) :2495-+