| 关于含1—因子图幂中边不交1—因子 |
| |
| 引用本文： | 张建勋,房振才.关于含1—因子图幂中边不交1—因子[J].应用数学,1993,6(1):21-25. |
| |
| 作者姓名： | 张建勋 房振才 |
| |
| 作者单位： | 兰州铁道学院，新乡市教育学院 兰州 730070，新乡 453000 |
| |
| 摘 要： | 本文讨论一般含1-因子连通图的n次幂中边不交1-因子的个数.从而证明了L.Nebesky(1984)猜想对含1-因子图成立.
|
| 关 键 词： | 图 幂 连通图 1因子 |
On The Numbers of Edge-Disjoint 1-Factors In The Powers of The Connected Graphs With 1-Factors |
| |
| Zhang Jianxun.On The Numbers of Edge-Disjoint 1-Factors In The Powers of The Connected Graphs With 1-Factors[J].Mathematica Applicata,1993,6(1):21-25. |
| |
| Authors: | Zhang Jianxun |
| |
| Institution: | Zhang Jianxun (Lanzhou Ralway Institute) Fang Zhengai(Xenxiang education institute) |
| |
| Abstract: | In this paper, the numbers of the edge-disjoint 1-factors in the powers of the graphs with 1-factors have been discussed. So the L. Nebesky's conjecture (1984) has been proven for the graphs with 1-factors. |
| |
| Keywords: | Graphs 1-Factors Power |
| 本文献已被 CNKI 维普 等数据库收录！ |
