Orthogonal double cover of Complete Bipartite Graph by disjoint union of complete bipartite graphs

Let H be a graph on n vertices and G 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 occurs in exactly two members of G and any two members share an edge whenever the corresponding vertices are adjacent in H and share no edges when...

Full description

Bibliographic Details

Published in:	Ain Shams Engineering Journal
Main Authors:	S. El-Serafi, R. El-Shanawany, H. Shabana
Format:	Article
Language:	English
Published:	Elsevier 2015-06-01
Subjects:	Graph decomposition Orthogonal double cover Symmetric starter
Online Access:	http://www.sciencedirect.com/science/article/pii/S2090447914001671