Cycle Embedding in Generalized Recursive Circulant Graphs
نویسندگان
چکیده
منابع مشابه
Pancyclicity of recursive circulant graphs
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic and bipancyclic. 2002 Elsevier Science B.V. All rights reserved.
متن کاملDisjoint Hamiltonian Cycles in Recursive Circulant Graphs
We show in this paper that the circulant graph G( 2”‘, 4) is Hamiltonian decomposable, and propose a recursive construction method. This is a partial answer to a problem posed by B. Alspach. @ 1997 Published by Elsevier Science B.V.
متن کاملHamiltonian decomposition of recursive circulant graphs
The graph G(N; d) has vertex set V = {0; 1; : : : ; N − 1}, with {v; w} an edge if v − w ≡ ±di(modN ) for some 06i6dlogd Ne − 1. We show that the circulant graph G(cd; d) is Hamilton decomposable for all positive integers c; d, and m with c¡d. This extends work of Micheneau and answers a special case of a question of Alspach. c © 2000 Elsevier Science B.V. All rights reserved.
متن کاملon the symmetries of some classes of recursive circulant graphs
a recursive-circulant $g(n; d)$ is defined to be acirculant graph with $n$ vertices and jumps of powers of $d$.$g(n; d)$ is vertex-transitive, and has some strong hamiltonianproperties. $g(n; d)$ has a recursive structure when $n = cd^m$,$1 leq c < d $ [10]. in this paper, we will find the automorphismgroup of some classes of recursive-circulant graphs. in particular, wewill find that the autom...
متن کاملThe super-connected property of recursive circulant graphs
In a graph G, a k-container Ck(u, v) is a set of k disjoint paths joining u and v. A k-container Ck(u, v) is k ∗-container if every vertex of G is passed by some path in Ck(u, v). A graph G is k ∗-connected if there exists a k∗-container between any two vertices. An m-regular graph G is super-connected if G is k∗-connected for any k with 1 k m. In this paper, we prove that the recursive circula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2018
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2018pap0009