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: | R.A. El-Shanawany, M. Higazy, H. Shabana, A. El-Mesady |
---|---|
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 |
Similar Items
-
Orthogonal double cover of Complete Bipartite Graph by disjoint union of complete bipartite graphs
by: S. El-Serafi, et al.
Published: (2015-06-01) -
On Orthogonal Double Covers and Decompositions of Complete Bipartite Graphs by Caterpillar Graphs
by: Ahmed El-Mesady, et al.
Published: (2023-06-01) -
Circular Intensely Orthogonal Double Cover Design of Balanced Complete Multipartite Graphs
by: M. Higazy, et al.
Published: (2020-10-01) -
On cyclic orthogonal double covers of circulant graphs by special infinite graphs
by: R. El-Shanawany, et al.
Published: (2017-12-01) -
On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares
by: M. Higazy, et al.
Published: (2020-11-01)