| 局部有限无穷n-连通图1-因子的下界 |
| |
| 引用本文： | 郑茂林. 局部有限无穷n-连通图1-因子的下界[J]. 新疆大学学报(理工版), 1987, 0(3) |
| |
| 作者姓名： | 郑茂林 |
| |
| 摘 要： | Bry[1]证明;一个局部有限、有1-因子的无穷n-连通图至少有(n-1)1个1-因子。并且指出当n=2,此下界是严格的。本文证明;当n≥3时,任意一个局部有限的、有1-因子的、无穷n-连通图至少有n!个1-因子,而且这个下界是最好的。
|
| 关 键 词： | 局部有限 无穷n-连通图 1-因子 下界 |
LOWER BOUND ON THE NUMBER OF 1-FACTORS OF LOCALLFINITE INFINITE n-CONNECTED GRAPHS |
| |
| Zheng Maolin. LOWER BOUND ON THE NUMBER OF 1-FACTORS OF LOCALLFINITE INFINITE n-CONNECTED GRAPHS[J]. Journal of Xinjiang University(Science & Engineering), 1987, 0(3) |
| |
| Authors: | Zheng Maolin |
| |
| Affiliation: | Zheng Maolin |
| |
| Abstract: | Bry [1] proved that a locally finite infinite n-connected factorizable graph has atleast (n-1)! 1-factors, and showed that for n=2 this lower bound is sharp. Weprove that for n=3 any locally finite infinite n-connected factorizable graph has atleast n? 1-factors (which is a sharp lower bound.) |
| |
| Keywords: | locally finite infinite n-connected graphs l-factor Iower bound |
| 本文献已被 CNKI 等数据库收录！ |
