引用本文: | 谢政,戴丽,王栓狮.具有正交(g,f)-因子分解的子图[J].国防科技大学学报,2001,23(1):97-101.[点击复制] |
XIE Zheng,DAI Li,WANG Shuanshi.Orthogonal (g,f) -Factorizations of Subgraphs[J].Journal of National University of Defense Technology,2001,23(1):97-101[点击复制] |
|
|
|
本文已被:浏览 6584次 下载 5814次 |
具有正交(g,f)-因子分解的子图 |
谢政, 戴丽, 王栓狮 |
(国防科技大学 理学院,湖南 长沙 410073)
|
摘要: |
设G是一个图,g(x)和f(x)是定义在V(G)上的整数值函数,且对任意的x∈V(G),设g(x)≤f(x),H是G的一个子图,F={F1,F2,…,Ft}是G的一个因子分解,如果对任意的1≤i≤t,|E(H)∩E(Fi)|=1,则称F与H正交。闫桂英和潘教峰在文[3]中提出如下猜想:设G是一个(mg+k,mf-k)-图,1≤k
|
关键词: 图 因子 因子分解 正交 |
DOI: |
投稿日期:2000-09-28 |
基金项目: |
|
Orthogonal (g,f) -Factorizations of Subgraphs |
XIE Zheng, DAI Li, WANG Shuanshi |
(College of Science, National Univ. of Defense Technology, Changsha 410073, China)
|
Abstract: |
We deal with simple graphs only. Let G be a graph,and g(x) and f (x) be integer-valued functions defined on V(G) such that g(x)≤f(x) for every x∈V(G).Let H is a subgraph of G and F={F1,F2,…,Ft} is a (g,f) factorization of G. If |E(H)∩E(Fi)|=1, 1≤i≤t,then we say that F is orthogonal to H.In the paper[3],Yan Guiying and Pan Jiaofeng gave the conjecture:Let G is an (mg+k,mf-k)-graph,1≤k
|
Keywords: graph factor factorization orthogonality |
|
|
|
|
|