| 本文已被：浏览 758次 下载 1705次 |
码上扫一扫！ |
|
|
| 完美整数k-匹配和k-因子临界图 |
|
张燕红1, 张磊1,2,3, 任海珍1,2,3
|
|
1.青海师范大学 数学与统计学院, 西宁 810008;2.藏文信息处理与应用国家重点实验室, 西宁 810008;3.高原科学与可持续发展研究院, 西宁 810008
|
|
| 摘要: |
| 本文研究完美整数k-匹配和k-因子临界图的存在性.扩张常数表示图的连通强度,对于正则图,利用扩张常数给出了完美整数k-匹配存在的一个充分条件,这推广了Hamers等人和Cioabă等人的结果.此外,对于正则图,基于扩张常数还给出了k-因子临界图存在的一个充分条件. |
| 关键词: 完美整数k-匹配 k-因子临界图 连通性 扩张常数 |
| DOI： |
| 分类号:O157.5;O153.1 |
| 基金项目: |
|
| THE PERFECT INTEGER k-MATCHINGS AND k-FACTOR-CRITICAL GRAPHS |
|
ZHANG Yan-hong1, ZHANG Lei1,2,3, REN Hai-zhen1,2,3
|
|
1.School of Mathematics and Statistics, Qinghai Normal University, Xining 810008, China;2.The State Key Laboratory of Tibetan Information Processing and Application, Xining 810008, China;3.Academy of Plateau, Science and Sustainability, Xining 810008, China
|
| 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 regular 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. |
| Key words: perfect integerk-matching k-factor-critical graph connectivity expansion constant |
