Please use this identifier to cite or link to this item:
Title: On edge-Hamiltonian property of Cayley graphs
Authors: Chen, C.C. 
Issue Date: Dec-1988
Source: Chen, C.C. (1988-12). On edge-Hamiltonian property of Cayley graphs. Discrete Mathematics 72 (1-3) : 29-33. ScholarBank@NUS Repository.
Abstract: Let G be a group generated by X. A Cayley graph over G is defined as a graph G(X) whose vertex set is G and whose edge set consists of all unordered pairs [a,b] with a, b ε{lunate} G and a-1b ε{lunate} X ∩ X-1, where X-1 denotes the set {x-1 {divides} x ε{lunate} X}. When X is a minimal generating set or each element of X is of even order, it can be shown that G(X) is Hamiltonian if it is edge-Hamiltonian. Hence every Cayley graph of order a power of 2 is edge-Hamiltonian. © 1988.
Source Title: Discrete Mathematics
ISSN: 0012365X
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

checked on Jan 12, 2018

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.