General Cyclic Orthogonal Double Covers of Finite Regular Circulant Graphs
نویسندگان
چکیده
An orthogonal double cover (ODC) of a graph H is a collection ( ) { } v G v V H : = ∈ of ( ) V H subgraphs (pages) of H, so that they cover every edge of H twice and the intersection of any two of them contains exactly one edge. An ODC of H is cyclic (CODC) if the cyclic group of order ( ) V H is a subgroup of the automorphism group of . In this paper, we introduce a general orthogonal labelling for CODC of circulant graphs and construct CODC by certain classes of graphs such as complete bipartite graph, the union of the co-cycles graph with a star, the center vertex of which, belongs to the co-cycles graph and graphs that are connected by a one vertex.
منابع مشابه
Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes
A finite Frobenius group is a permutation group which is transitive but not regular such that only the identity element can fix two points. Such a group can be expressed as a semidirect product G = K o H, where K is a nilpotent normal subgroup. A first-kind G-Frobenius graph is a Cayley graph on K whose connection set is an H-orbit S on K that generates K, where H is of even order or S consists...
متن کاملDefensive alliances in regular graphs and circulant graphs
In this paper we study defensive alliances in some regular graphs. We determine which subgraphs could a critical defensive alliance of a graph G induce, if G is 6-regular and the cardinality of the alliance is at most 8. In particular, we study the case of circulant graphs, i.e. Cayley graphs on a cyclic group. The critical defensive alliances of a circulant graph of degree at most 6 are comple...
متن کاملStrongly Regular Integral Circulant Graphs and Their Energies
Let S ⊂ Zn be a finite cyclic group of order n > 1. Assume that 0 / ∈ S and −S = {−s : s ∈ S} = S. The circulant graph G = Cir(n, S) is the undirected graph having the vertex set V (G) = Zn and edge set E(G) = {ab : a, b ∈ Zn, a− b ∈ S}. Let D be a set of positive, proper divisors of the integer n. We characterize certain strongly regular integral circulant graphs with energy 2n(1− 1/d) for a f...
متن کاملAutomorphism Groups of Rational Circulant Graphs
The paper concerns the automorphism groups of Cayley graphs over cyclic groups which have a rational spectrum (rational circulant graphs for short). With the aid of the techniques of Schur rings it is shown that the problem is equivalent to consider the automorphism groups of orthogonal group block structures of cyclic groups. Using this observation, the required groups are expressed in terms o...
متن کاملOn the cyclic decomposition of circulant graphs into bipartite graphs
It is known that if a bipartite graph G with n edges possesses any of three types of ordered labelings, then the complete graphK2nx+1 admits a cyclic G-decomposition for every positive integer x. We introduce variations of the ordered labelings and show that whenever a bipartite graph G admits one of these labelings, then there exists a cyclic G-decomposition of an infinite family of circulant ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014