Abstract
An orthogonal double cover (ODC) of a graph H is a collection G = {G(v) : v is an element of V(H)} of vertical bar V(H)vertical bar subgraphs of H such that every edge of H is contained in exactly two members of G and for any two members G(u) and G(v) in G, vertical bar E(G(u)) boolean AND E(G(v))vertical bar is 1 if u and v are adjacent in H and it is 0 if u and v are nonadjacent in H.
In this paper, we are concerned with the Cartesian product of symmetric starter vectors of orthogonal double covers of the complete bipartite graphs and using this method to construct ODCs for new graph classes. (C) 2015 Kalasalingam University. Production and Hosting by Elsevier B.V.