Orthogonal Double Covers of Complete Bipartite Graphs by Certain Disjoint Union Cyclic Graphs | Asia

Let G be a collection of 2n subgraphs of kn,n and kn,n be a complete bipartite graph with 2n vertices. Every edge of kn,n is included in precisely two members of G, and any two members share an edge when the corresponding vertices are adjacent in kn,n and share no edges when the corresponding vertices are non-adjacent in kn,n, and all subgraphs in G are isomorphic to a given subgraph G of kn,n. The goal of this article is to obtain an ODC of kn,n using Cs;sn, and to create huge (ODCs) of kn,n using (Cs); where m=n;Z+.

Please see the link :- https://globalpresshub.com/index.php/AJPAM/article/view/1335