| 图的（g，f）－因子和因子分解 |
| |
| 引用本文： | 刘桂真.图的（g，f）－因子和因子分解[J].数学学报,1994,37(2). |
| |
| 作者姓名： | 刘桂真 |
| |
| 作者单位： | 山东大学数学系 |
| |
| 摘 要： | 设Ｇ是一个图，ｇ，ｆ是定义在图Ｇ的顶点集上的两个整数值函数且图Ｇ的一个（ｇ，ｆ）－因子是Ｇ的一个支撑子图Ｆ使对任意的ｘ∈Ｖ（Ｆ）有本文给出了一个图（ｇ，ｆ）－可因子化的若干充分条件和一个图是（ｇ，ｆ）－消去图的充分必要条件，并研究了这些条件的应用。
|
| 关 键 词： | 图，因子，因子分解，消去图 |
| 收稿时间： | 1990-12-19 |
| 修稿时间： | 1993-2-15 |
(g,f)-Factors and Factorizations of Graphs |
| |
| Liu Guizhen.(g,f)-Factors and Factorizations of Graphs[J].Acta Mathematica Sinica,1994,37(2). |
| |
| Authors: | Liu Guizhen |
| |
| Institution: | Liu Guizhen(Department of Mathematics,Shandong University Jina 250100,China) |
| |
| Abstract: | Let G be a graph and g,j be two integer-valued hinctions defined on the vertexset of G and (g,f)-factor of a graph G is a spanning subgraph F of G such thatfor each vertex x of F Inthis paper some sumcient conditions for a graphto be (g,f)-factorable and a necessary and sufficient condition for a grah to be a (g,f)-deleted guaph are given Some applications of these conditions are discussed . |
| |
| Keywords: | graph factor fatorization deleted graph |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《数学学报》浏览原始摘要信息 |
| 点击此处可从《数学学报》下载免费的PDF全文 |
|
