✦ LIBER ✦

Hamilton cycles in tensor product of graphs

✍ Scribed by R. Balakrishnan; P. Paulraja

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 598 KB
Volume: 186
Category: Article
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(97)00215-x

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper, we characterize graphs G for which G®K2 is Hamiltonian, where ® denotes the tensor product of graphs. The relationship between the bieulerian orientation of a 4-regular graph G and the existence of a pair of edge-disjoint Hamilton cycles in G®K2 is established. Also a characterization for a 4-regular graph to have a bieulerian orientation is presented. Finally, some conjectures of Jha relating to the existence of cycles or edge-disjoint Hamilton cycles are either proved or disproved.

📜 SIMILAR VOLUMES

Hamilton cycles in strong products of gr

Hamilton cycles in strong products of graphs

✍ Daniel Král'; Jana Maxová; Robert Šámal; Pavel Podbrdský 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB

## Abstract We prove that the strong product of any __n__ connected graphs of maximum degree at most __n__ contains a Hamilton cycle. In particular, __G__^Δ(__G__)^ is hamiltonian for each connected graph __G__, which answers in affirmative a conjecture of Bermond, Germa, and Heydemann. © 2005 Wile

Hamilton cycles in regular graphs

✍ Bill Jackson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 135 KB

## UNIVERSIW OF WATERLOO ' The research reported here has been sponsored by the Canadian Commonwealth Association.

Edge disjoint Hamilton cycles in graphs

✍ Guojun Li 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB 👁 2 views

Hamilton cycles in claw-free graphs

✍ Cun-Quan Zhang 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 299 KB 👁 2 views

Pancyclic Hamilton cycles in random grap

Pancyclic Hamilton cycles in random graphs

✍ C. Cooper 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 466 KB

Hamilton cycles in Trivalent Cayley grap

Hamilton cycles in Trivalent Cayley graphs

✍ Meghanad D. Wagh; Jiancheng Mo 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 455 KB

It is shown that the Trivalent Cayley graphs, TC,,, are near recursive. In particular, TC, is a union of four copies of i"Cn\_2 with additional well placed nodes. This allows one to recursively build the Hamilton cycle in TC,.