Theoretical Analysis of Communication Networks in a Bipartite Setting

Many real-world network problems are modeled by digraphs. In this paper, we study orthogonal factorization for bipartite digraph, and show the following result: Let G be a bipartite (0, mf?m+1)-digraph. Let f be an integer-valued function defined on V(G) such that k ? f(x), and let H1, …, Hk be an m-subdigraph of G. Then G has a (0, f)-factorization orthogonal to each Hi (1 ? i ? k).