Discussions on Orthogonal Factorizations in Digraphs  

作　　者：Si-zhong ZHOU Hong-xia LIU 

机构地区：[1]School of Science,Jiangsu University of Science and Technology,Zhenjiang 212100,China [2]School of Mathematics and Information Sciences,Yantai University,Yantai 264005,China

出　　处：《Acta Mathematicae Applicatae Sinica》2022年第2期417-425,共9页应用数学学报（英文版）

摘　　要：Let m,t,r and k_(i)(1≤i≤m)be positive integers with k_(i)≥(t+3)r/2,and G be a digraph with vertex set V(G)and arc set E(G).Let H_(1),H_(2),…,H_(t) be t vertex-disjoint subdigraphs of G with mr arcs.In this article,it is verified that every[0,k_(1)+k_(2)+…+k_(m)-(m-1)r]-digraph G has a[0,k_(i)]_(1)^(m)-factorization r-orthogonal to every H_(i) for 1≤i≤t.

关 键 词：NETWORK DIGRAPH FACTOR FACTORIZATION orthogonal factorization 

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