Cartesian product of two symmetric starter vectors of orthogonal double covers
An orthogonal double cover (ODC) of a graph H is a collection G={Gv:v∈V(H)} of |V(H)| subgraphs of H such that every edge of H is contained in exactly two members of G and for any two members Gu and Gv in G, |E(Gu)∩E(Gv)| is 1 if u and v are adjacent in H and it is 0 if u and v are nonadjacent in H....
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2015-07-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S0972860015000109 |
| Summary: | An orthogonal double cover (ODC) of a graph H is a collection G={Gv:v∈V(H)} of |V(H)| subgraphs of H such that every edge of H is contained in exactly two members of G and for any two members Gu and Gv in G, |E(Gu)∩E(Gv)| 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. |
|---|---|
| ISSN: | 0972-8600 |