On Orthogonal Double Covers of Complete Bipartite Graphs by an Infinite Certain Graph-Path and Graph-Cycle
Journal of Advances in Mathematics and Computer Science · pp. 2320–2325 · Published 17 Jun 2014
10.9734/BJMCS/2014/10724Abstract
Let F be a certain graph, the graph F-Path denoted by d+1(F) path of length d with d + 1 ver-tices (i.e. Every edge of this path is one-to-one corresponding to an isomorphic to the graph F). In the same manner, we define the graph F-Cycle as d(F) cycle on d vertices. In this paper, we construct orthogonal double covers (ODCs) of complete bipartite graph Kn,n by d+1(F) and d(F).
Cited by 0
No indexed citations yet.
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 Circulant Graphs — shares topic coverage
- Orthogonal Double Covers of Complete Bipartite Graphs by A Special Class of Disjoint Union of Path and A Complete Bipartite Graph — 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
0
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.