| 正则k-覆盖图 |
| |
| 引用本文： | 陆桂发. 正则k-覆盖图[J]. 苏州科技学院学报(社会科学版), 1992, 0(Z3) |
| |
| 作者姓名： | 陆桂发 |
| |
| 作者单位： | 苏州市科委 |
| |
| 摘 要： | 图G的k-正则生成子图称为G的一个k-因子,若图G的每条边都含于G的一个k-因子中,称图G足k-覆盖的。对任意给定的正整数γ、λ和k(λ≥2),基于文[1,2]的已知结论,本文给出了所有γ-正则λ-边连通图是k-覆盖图的充分必要条件。
|
| 关 键 词： | 正则图 k-因子 k-覆盖图 |
On Regular K-Covered Graphs |
| |
| Lu Guifa. On Regular K-Covered Graphs[J]. Journal of University of Science and Technology of Suzhou:Social Science, 1992, 0(Z3) |
| |
| Authors: | Lu Guifa |
| |
| Affiliation: | Scientific and Technological Committee in Suzhou |
| |
| Abstract: | A k-factor of graph G is a k-regular spanning subgraph of G. A graph G Is k-covered if each edge of G belongs to a k-factor. In this paper We give a necessary and sufficient condition for every X-edge-connected r-regular graph to be k-covered. |
| |
| Keywords: | regular graph k-factor k-covered graph |
| 本文献已被 CNKI 等数据库收录！ |
