Orthogonal Double Covers of Complete Bipartite Graphs by A Special Class of Disjoint Union of Path and A Complete Bipartite Graph
Journal of Advances in Mathematics and Computer Science · pp. 390–396 · Published 15 Jun 2013
10.9734/BJMCS/2013/3352Abstract
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 adjacent in H and share no edges whenever the corresponding vertices are non-adjacent in H. In this paper, we are concerned with the symmetric starter vectors of the orthogonal double covers of the complete bipartite graphs and using this method to construct ODCs by the disjoint union of path and a complete bipartite graph. Here, we consider Pm the path on m vertices where 4 ≤ m ≤ 11:
Cited by 1
S. El-Serafi, R. El-Shanawany, H. Shabana · Ain Shams Engineering Journal · 2015
Related research
- Orthogonal Double Covers of Kn,n by Infinite Classes of Disjoint Unions of Certain Complete Bipartite Spanning Subgraphs — shares topic coverage
- On Cartesian Products of Any Finite Number of Orthogonal Double Covers — shares topic coverage
- On Orthogonal Double Covers of Complete Bipartite Graphs by an Infinite Certain Graph-Path and Graph-Cycle — shares topic coverage
- On Orthogonal Double Covers of Circulant Graphs — shares topic coverage
- On the DAG Decomposition — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
1
Citations
Views by country
Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".
No views recorded yet.
Traffic sources
Referring site, by host.
No traffic recorded yet.
Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.