𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Pancyclicity of Strong Products of Graphs

✍ Scribed by Daniel Král; Jana Maxová; Pavel Podbrdský; Robert Šámal

Book ID
118783087
Publisher
Springer Japan
Year
2004
Tongue
English
Weight
352 KB
Volume
20
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Pancyclicity and extendability in strong
Pancyclicity and extendability in strong products
✍ Ramachandran, S.; Parvathy, R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 406 KB

In this paper, w e first prove that for any connected graph G with at least t w o vertices, there is an integer rn for which the strong product XGm has pancyclic ordering from each vertex. After characterizing the graphs G for which GXK2 is Hamiltonian, w e determine a criterion for extendability of

Pancyclicity of recursive circulant grap
Pancyclicity of recursive circulant graphs
✍ Toru Araki; Yukio Shibata 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 96 KB

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.

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

Strong products of Kneser graphs
Strong products of Kneser graphs
✍ Sandi Klavžar; Uroš Milutinović 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 314 KB

Let G [XI H be the strong product of graphs G and H. We give a short proof that Kneser graphs are then used to demonstrate that this lower bound is sharp. We also prove that for every n > 2 there is an infinite sequence of pairs of graphs G and G' such that G' is not a retract of G while G' IXI K,