✦ LIBER ✦

Pancyclicity and extendability in strong products

✍ Scribed by Ramachandran, S.; Parvathy, R.

Book ID: 101227345
Publisher: John Wiley and Sons
Year: 1996
Tongue: English
Weight: 406 KB
Volume: 22
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199605)22:1<75::aid-jgt10>3.0.co;2-n

No coin nor oath required. For personal study only.

✦ Synopsis

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 cycles. We also prove that if G is a connected, K1,3-free graph with 6 2 2, then GXK2 is fully cycle extendable as well as l-edge Hamiltonian.

📜 SIMILAR VOLUMES

Pancyclicity of Strong Products of Graph

Pancyclicity of Strong Products of Graphs

✍ Daniel Král; Jana Maxová; Pavel Podbrdský; Robert Šámal 📂 Article 📅 2004 🏛 Springer Japan 🌐 English ⚖ 352 KB

The number of pancyclic arcs in a k-stro

The number of pancyclic arcs in a k-strong tournament

✍ Anders Yeo 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 98 KB 👁 2 views

## Abstract A __tournament__ is a digraph, where there is precisely one arc between every pair of distinct vertices. An arc is __pancyclic__ in a digraph __D__, if it belongs to a cycle of length __l__, for all 3 ≤ __l__ ≤ |__V__ (__D__) |. Let __p__(__D__) denote the number of pancyclic arcs in a

Kronecker products of paths and cycles:

Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity

✍ Pranava K. Jha 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 690 KB

Let G x H denote the Kronecker product of graphs G and H. Principal results are as follows: (a) If m is even and n-0 (mod 4), then one component of P,.+l x P,+1, and each component of each of CA x Pn+l, Pm+l x (7, and Cm x C, are edge decomposable into cycles of uniform length rs, where r and s are

On the Strong Product of a k-Extendable

On the Strong Product of a k-Extendable and an l-Extendable Graph

✍ Ervin Győri; Wilfried Imrich 📂 Article 📅 2001 🏛 Springer Japan 🌐 English ⚖ 128 KB

Minors and Strong Products

✍ Andrei Kotlov 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 56 KB

Matching Extendability in Hypercubes

✍ Vandenbussche, Jennifer; West, Douglas B. 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 208 KB