Acta mathematica scientia,Series B ›› 1998, Vol. 18 ›› Issue (4): 461-465.

• Articles • Previous Articles     Next Articles

ON ORTHOGONAL[0,k1]1m-FACTORIZATION OF GRAPHS

Ma Runnian1, Bai Guoqiang2   

  1. 1. Air Force Telecommunication Engineering Institute, Xi'an 710077, China;
    2. Shaanix Finance and Economics Institute, Xi'an 710061, China
  • Received:1996-05-20 Revised:1997-07-20 Online:1998-12-25 Published:1998-12-25

Abstract: Let G be a graph, k1,…, km be positive integers. If dG(x) ≤ k1+…+km-m+1 for all xV(G),and H is a m-path,or a m-cycle,then G has a[0,ki]1m-factorization orthogonol to H.

Key words: Graph, factor, orthogonal factorization

Trendmd