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: 1988
Citation: Chen, C.C. (1988). On Edge-Hamiltonian Property of Cayley Graphs. Annals of Discrete Mathematics 38 (C) : 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, be{open}G and a-1X-1, where X-1 denotes the set {x-1|Xe{open}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 iff it is edge-Hamiltonian. Hence every Cayley graph of order a power of 2 is edge-Hamiltonian. © 1988.
Source Title: Annals of Discrete Mathematics
ISSN: 01675060
DOI: 10.1016/S0167-5060(08)70768-4
Appears in Collections:Staff Publications

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


checked on Nov 15, 2018

Page view(s)

checked on Sep 28, 2018

Google ScholarTM



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