On Cartesian Products of Any Finite Number of Orthogonal Double Covers
Current Journal of Applied Science and Technology · pp. 2231–2240 · Published 7 Apr 2014
10.9734/BJAST/2014/8689Abstract
We are concerned with the cartesian products of any finite number of symmetric starter vectors of orthogonal double covers of the complete bipartite graphs and use this method to construct ODCs by new infinite classes of disjoint unions of complete bipartite graphs.
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
- A Constructive Method for Using Known Groups as Building Blocks to form More Groups — shares topic coverage
- The Domination Number of Pm x Pn — 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.