✦ LIBER ✦

Pancyclicity of recursive circulant graphs

✍ Scribed by Toru Araki; Yukio Shibata

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 96 KB
Volume: 81
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00226-5

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Erratum to “Pancyclicity of recursive ci

Erratum to “Pancyclicity of recursive circulant graphs”: [Inform. Process. Lett. 81 (2002) 187–190]

✍ Tom Araki; Yukio Shibata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 19 KB

Pancyclicity of connected circulant grap

Pancyclicity of connected circulant graphs

✍ Bogdanowicz, Z. R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB 👁 1 views

The circulant G,(al,. . . , ak), where 0 < al < ... < a k < ( n + 1 ) / 2 , is defined as the vertex-transitive graph that has vertices ifal,. . . ,if a k (mod n) adjacent to each vertex i. In this work we show that the connected circulants of degree at least three contain all even cycles. In additi

Recognizing Recursive Circulant Graphs (

Recognizing Recursive Circulant Graphs (Extended Abstract)

✍ Guillaume Fertin; André Raspaud 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 285 KB

Disjoint Hamiltonian cycles in recursive

Disjoint Hamiltonian cycles in recursive circulant graphs

✍ C. Micheneau 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 499 KB

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. @

Pancyclic subgraphs of random graphs

✍ Choongbum Lee; Wojciech Samotij 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 249 KB

## Abstract An __n__‐vertex graph is called pancyclic if it contains a cycle of length __t__ for all 3≤__t__≤__n__. In this article, we study pancyclicity of random graphs in the context of resilience, and prove that if __p__>__n__^−1/2^, then the random graph __G__(__n, p__) a.a.s. satisfies the f

Reliability analysis of circulant graphs

✍ Li, Qiaoliang; Li, Qiao 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 82 KB 👁 2 views

The circulant graphs are of particular interest as models of communication networks. In this work, we present new reliability analysis results for circulants based on the concept of restricted edge connectivity, which generalizes the super-l property of a graph. We evaluate the restricted edge conne