Hamilton cycles in Trivalent Cayley graphs

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

Saved in:
Bibliographic Details
Published in:Information processing letters 1996-11, Vol.60 (4), p.177-181
Main Authors: Wagh, Meghanad D., Mo, Jiancheng
Format: Article
Language:English
Subjects:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Cayley graphs
Computer architecture
Computer science
control theory
systems
Exact sciences and technology
Information retrieval. Graph
Interconnection networks
Mapping
Parallel algorithms
Parallel processing
Studies
Theoretical computing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It is shown that the Trivalent Cayley graphs, TC n , are near recursive. In particular, TC n is a union of four copies of TC n − 2 with additional well placed nodes. This allows one to recursively build the Hamilton cycle in TC n .
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(96)00158-5