✦ LIBER ✦

Hamilton cycles in Trivalent Cayley graphs

✍ Scribed by Meghanad D. Wagh; Jiancheng Mo

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 455 KB
Volume: 60
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(96)00158-5

No coin nor oath required. For personal study only.

✦ Synopsis

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

📜 SIMILAR VOLUMES

Hamilton cycle and Hamilton path extenda

Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups

✍ Štefko MiklaviČ; Primož Šparl 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB

## Abstract In this paper the concepts of Hamilton cycle (HC) and Hamilton path (HP) extendability are introduced. A connected graph Γ is __n__‐__HC‐extendable__ if it contains a path of length __n__ and if every such path is contained in some Hamilton cycle of Γ. Similarly, Γ is __weakly n__‐__HP‐

Hamiltonian cycles in cayley color graph

Hamiltonian cycles in cayley color graphs

✍ Joseph B. Klerlein 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB 👁 1 views

## Abstract A group Γ is said to possess a hamiltonian generating set if there exists a minimal generating set Δ for Γ such that the Cayley color graph __D__~Δ~(Γ) is hamiltonian. It is shown that every finite abelian group has a hamiltonian generating set. Certain classes of nonabelian groups are

Shortest routing in trivalent Cayley gra

Shortest routing in trivalent Cayley graph network

✍ Premkumar Vadapalli; Pradip K. Srimani 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 458 KB

Trivalent Cayley graphs for interconnect

Trivalent Cayley graphs for interconnection networks

✍ Premkumar Vadapalli; Pradip K. Srimani 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 625 KB

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.

Exceptional trivalent cayley graphs for

Exceptional trivalent cayley graphs for dihedral groups

✍ David L. Powers 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 432 KB

## Abstract If __n__ is divisible by at least three distinct primes, the dihedral group __D~n~__ can be generated by three nonredundant, involuntary elements. We study the Cayley graphs resulting from such a presentation of __D~n~__ for several families of __n__ and for all admissible __n__ < 120.