TWO-FOLD FACTORIZATION OF THE COMPLETE BIPARTITE GRAPHS BY INFINITE GRAPH CLASSES
Two-fold factorization of a graph H is a combination of subgraphs of H where every edge of H is found precisely in two elements of and for any two elements and in is 1 if u and v are adjacent in H and it is 0 if u and v are nonadjacent in H. This paper constructs two-fold factorizations of the complete bipartite graphs by a given infinite graph classes.
graph decomposition, two fold factorization, symmetric generator, Cartesian product.