(0,mf-k+1)-图中具有正交(0,f)-因子分解的子图(英文)

Subgraph with orthogonal(0,f)-factorization in (0,mf-k+1)-graph

设G是一个简单图,f是定义在V(G)上的整数值函数,且m是大于等于2的整数,讨论(0,mf-κ+1)-图G的正交因子分解,并且证明了对任意的1≤κ≤m,(0,mf-λ+1)-图G中存在着一个子图R,使得R有一个(0,f)-因子分解正交于图G中的任意一个κ-子图H。

Let G be a simple graph, f be a non-negative integer-valued function defined on V（G）, m≥ 2 and be an integer. In this paper, we investigate the orthogonal factorization of （0, mf - k ＋ 1）-graph and prove that, for any integer 1 ≤ k ≤ m, every （0, m f-k＋ 1）-graph G has a subgraph R such that, R has a （0, f）-factorization orthogonal to any k-subgraph H of G.