We are concerned with the cartesian products of any finite number of symmetric starter vectors of orthogonal double covers of the complete bipartite graphs and use this method to construct ODCs by new infinite classes of disjoint unions of complete bipartite graphs.
Open access
Research Article10.9734/BJAST/2014/8689
Let X be a graph on n vertices and let B = {P(x) : x ∈ V (X)} be a collection of n subgraphs of X, one for each vertex, B is an orthogonal double cover (ODC) of X if every edge of X occurs in exactly two members of B and any two members share an edge whenever the corresponding ve...
Open access
Research Article10.9734/BJMCS/2014/5999
Let H be a graph on n vertices and let G be a collection of n subgraphs of H, one for each vertex, G is an orthogonal double cover (ODC) of H if every edge of H is contained in exactly two members of G and any two members share an edge whenever the corresponding vertices are adja...
Open access
Research Article10.9734/BJMCS/2013/3352
An orthogonal double cover (ODC) of any graph H is a collection of spanning subgraphs of H such that every two of them share exactly one edge at most, and every edge of the graph H belongs to exactly two of the spanning graphs. In this paper, we are concerned with the orthogonal...
Open access
Research Article10.9734/AIR/2014/10262