On Cyclic Orthogonal Double Covers of Circulant Graphs using Infinite Graph Classes
Journal of Advances in Mathematics and Computer Science · pp. 425–436 · Published 15 Jun 2013
10.9734/BJMCS/2013/4165Abstract
An orthogonal double cover (ODC) of a graph is a collection of subgraphs of such that every edge of is contained in exactly two members of and for any two members and in , is 1 if and it is 0 if . An ODC of is cyclic (CODC) if the cyclic group of order is a subgroup of the automorphism group of . In this paper, the CODCs of certain circulants with a specific regularity by certain infinite graph classes are concerned.
Cited by 2
A. El-Mesady, T. Farahat · Missouri Journal of Mathematical Sciences · 2022
R. El-Shanawany, A. El-Mesady · AKCE International Journal of Graphs and Combinatorics · 2017
Related research
- On Cartesian Products of Any Finite Number of Orthogonal Double Covers — shares topic coverage
- On the DAG Decomposition — 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
- Orthogonal Double Covers of Complete Bipartite Graphs by A Special Class of Disjoint Union of Path and A Complete Bipartite Graph — shares topic coverage
Article metrics
Real usage data collected on this platform.
0
Page views
0
PDF downloads
0
Outbound clicks
2
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.