[0, ki ]1m -FACTORIZATIONS ORTHOGONAL TO A SUBGRAPH  

作　　者：马润年 许进 高行山 

机构地区：[1]Electronic Engineering Research Institute, Xidian University, Xi' an 710071, P R China [2]Department of Engineering Mechanics, Northwestern Polytechnical University, Xi'an 710072, P R China

出　　处：《Applied Mathematics and Mechanics(English Edition)》2001年第5期593-596,共4页应用数学和力学（英文版）

基　　金：theNationalNaturalScienceFoundationofChina (6 9971 0 1 8)

摘　　要：Let G be a graph, k(1), ... , k(m) be positive integers. If the edges of graph G can be decomposed into some edge disjoint [0, k(1)]-factor F-1, ..., [0, k(m)]-factor F-m, then we can say (F) over bar = {F-1, ..., F-m}, is a [0, k(i)](1)(m) -factorization of G. If H is a subgraph with m edges in graph G and / E (H) boolean AND E(F-i) / = 1 for all 1 less than or equal to i less than or equal to m, then we can call that (F) over bar is orthogonal to H. It is proved that if G is a [0, k(1) + ... + k(m) - m + 1]-graph, H is a subgraph with m edges in G, then graph G has a [0, k(i)](1)(m)-factorization orthogonal to H.Let G be a graph, k(1), ... , k(m) be positive integers. If the edges of graph G can be decomposed into some edge disjoint [0, k(1)]-factor F-1, ..., [0, k(m)]-factor F-m, then we can say (F) over bar = {F-1, ..., F-m}, is a [0, k(i)](1)(m) -factorization of G. If H is a subgraph with m edges in graph G and / E (H) boolean AND E(F-i) / = 1 for all 1 less than or equal to i less than or equal to m, then we can call that (F) over bar is orthogonal to H. It is proved that if G is a [0, k(1) + ... + k(m) - m + 1]-graph, H is a subgraph with m edges in G, then graph G has a [0, k(i)](1)(m)-factorization orthogonal to H.

关 键 词：GRAPH factor FACTORIZATION orthogonal factorization 

分 类 号：O157.5[理学—数学]