| 完全-因子和(g,f)-对等图 |
| |
| 引用本文： | 刘红霞,高敬振.完全-因子和(g,f)-对等图[J].大学数学,2007,23(3):37-41. |
| |
| 作者姓名： | 刘红霞 高敬振 |
| |
| 作者单位： | 1. 烟台大学,数学与信息科学学院,烟台,264005
2. 山东师范大学,数学院,济南,250014 |
| |
| 基金项目： | 国家自然科学基金资助项目(10571005) |
| |
| 摘 要： | 若图的因子F的每一个分支都是完全图,则称F为完全-因子.本文研究了完全-因子F和(g,f)-对等图之间的关系,给出了有完全-因子F的图是(g,f)-对等图、f-对等图及k-对等图的关于F的分支的若干充分条件,并指出定理中的条件在一定意义上是最可能的,从而推广了李建湘等人的有关结果.
|
| 关 键 词： | 图 完全-因子 (g f)-因子 (g f)-对等图 |
| 文章编号： | 1672-1454（2007）03-0037-05 |
| 修稿时间： | 2005-10-17 |
Complete-Factors and (g,f)-Uniform Graphs |
| |
| LIU Hong-xia,GAO Jing-zhen.Complete-Factors and (g,f)-Uniform Graphs[J].College Mathematics,2007,23(3):37-41. |
| |
| Authors: | LIU Hong-xia GAO Jing-zhen |
| |
| Institution: | 1. Department of Mathematics and Informational Science, Yantai University, Yantai 264005, China~ 2. Department of Mathematics, Shandong Normal University, Jinan 250014, China |
| |
| Abstract: | A factor F of a graph is called a complete-factor if each component of F is complete.In this paper,the relationship between complete-factors and(g,f)-uniform graphs is discussed.Several sufficient conditions about components of factor F for graphs with complete factors to be(g,f)-uniform,f-uniform and k-uniform are given.We show that the results in this paper are best possible is some sense. |
| |
| Keywords: | graph complete-factor (g f)-factor (g f)-uniform graph |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
