| 二分图中含大圈的2-因子 |
| |
| 引用本文： | 颜谨,刘桂真.二分图中含大圈的2-因子[J].工程数学学报,2004,21(6):910-914. |
| |
| 作者姓名： | 颜谨 刘桂真 |
| |
| 作者单位： | 山东大学数学与系统科学学院,济南,250100;山东大学数学与系统科学学院,济南,250100 |
| |
| 基金项目： | This work is supported by NNSF of China (60172003) and NSF of Shandong Province
(Z2000A02). |
| |
| 摘 要： | 本文给出了均衡二分图有一个2-因子恰含k个大圈的度条件。设G=(V1，V2 E)是一个二分图，满足|V1|=|V2|=n≥sk。其中s≥3和k≥1是两个整数。如果图G的最小度至少为(1-1／s)n] 1。那么G有一个2-因子恰含k个圈使得每个圈长至少为2s。
|
| 关 键 词： | 二分图 圈 大圈 2-因子 |
On 2-Factors with Large Cycles in a Balanced Bipartite Graph |
| |
| Abstract.On 2-Factors with Large Cycles in a Balanced Bipartite Graph[J].Chinese Journal of Engineering Mathematics,2004,21(6):910-914. |
| |
| Authors: | Abstract |
| |
| Abstract: | In this paper, we investigate the degrees condition which implies that a balanced bipartite graph has a 2-factor with exactly κ vertex-disjoint large cycles. Let G = (V1, V2; E) be a bipartite graph with |V1| = |V2| = n ≥ sκ, where s ≥ 3 and κ≥ 1 are two integers. If the minimum degree of G is at least (1 - 1/s)n] + 1, then G has a 2-factor with exactly κ cycles of length at least 2s. |
| |
| Keywords: | bipartite graphs cycles large cycles 2-factors |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
