数学杂志2024，Vol.44Issue(3)：189-194,6.
完美整数k-匹配和k-因子临界图
THE PERFECT INTEGER k-MATCHINGS AND k-FACTOR-CRITICAL GRAPHS
摘要
Abstract
This article investigates the existence of perfect integer k-matchings and k-factor critical graphs.The extension constant represents the connectivity strength of a graph.For regu-lar graphs,a sufficient condition for the existence of perfect integer k-matching is given using the extension constant,which extends the results of Hamers et al.and Cioabǎ et al.In addition,for regular graphs,a sufficient condition for the existence of k-factor-critical graphs based on extension constant is also given.关键词
完美整数k-匹配/k-因子临界图/连通性/扩张常数Key words
perfect integer k-matching/k-factor-critical graph/connectivity/expansion con-stant分类
数理科学引用本文复制引用
张燕红,张磊,任海珍..完美整数k-匹配和k-因子临界图[J].数学杂志,2024,44(3):189-194,6.基金项目
Supported by National Natural Science Foundation of China(12161073),Nat-ural Science Foundation of Qinghai province(2020-ZJ-924). （12161073）
