完美整数k-匹配和k-因子临界图OACSTPCD
THE PERFECT INTEGER k-MATCHINGS AND k-FACTOR-CRITICAL GRAPHS
本文研究完美整数k-匹配和k-因子临界图的存在性.扩张常数表示图的连通强度,对于正则图,利用扩张常数给出了完美整数k-匹配存在的一个充分条件,这推广了 Hamers等人和Cioabǎ等人的结果.此外,对于正则图,基于扩张常数还给出了 k-因子临界图存在的一个充分条件.
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.
张燕红;张磊;任海珍
青海师范大学数学与统计学院,西宁 810008青海师范大学数学与统计学院,西宁 810008||藏文信息处理与应用国家重点实验室,西宁 810008||高原科学与可持续发展研究院,西宁 810008
数学
完美整数k-匹配k-因子临界图连通性扩张常数
perfect integer k-matchingk-factor-critical graphconnectivityexpansion con-stant
《数学杂志》 2024 (003)
189-194 / 6
Supported by National Natural Science Foundation of China(12161073),Nat-ural Science Foundation of Qinghai province(2020-ZJ-924).
评论