Acta mathematica scientia,Series A ›› 2000, Vol. 20 ›› Issue (3): 304-308.

• Articles • Previous Articles     Next Articles

(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

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  

CLC Number: 

  • 05C
Trendmd