数学物理学报 ›› 2000, Vol. 20 ›› Issue (3): 304-308.

• 论文 • 上一篇    下一篇

与任意图(m,r)-正交的(g,f)-因子分解

  

  1. (郑州大学数学系  郑州 450052)
  • 出版日期:2000-05-12 发布日期:2000-05-12

(g,f)-Factorizations (m,r)-Orthogonal to an Arbitrary Grapy

  1. (Department of Mathematics,Zhengzhou University,Zhengzhou 450052)
  • Online:2000-05-12 Published:2000-05-12

摘要:

设g和f是定义在图G的顶点集V(G)上的整值函数.证明了如下结果:设r是一个正整数,G是一个(mg+(m-1)r,mf-(m-1)r)-图,且g(x)≥r-1,对x∈V(G).则G是一个随机(m,r)-正交的(g,f)-可因子化图.

关键词: 因子, 因子分解, 随机(m, r), 正交

Abstract:

Let G and H be two integer valued function defined on the vertex set of a graph G. We show in this paper that: Suppose that r is a positive integer, G is an (mg+(m-1)r,mf-(m-1)r)-graph, and g(x)≥r-1 for x∈V(G),then G is a random (m,r)-orthogonal (g,f)-factorizable graph.

Key words: Factor, Factorization, Random (m, r), orthogonal  

中图分类号: 

  • 05C