Title: | Hamiltonian decomposition of generalized recursive circulant graphs |
Authors: | Chen, Y-Chuang Tsai, Tsung-Han 資訊工程學系 Department of Computer Science |
Keywords: | Fault tolerance;Hamiltonian decomposition;Circulant graph;Recursive circulant graph;Generalized recursive circulant graph |
Issue Date: | Sep-2016 |
Abstract: | In 2012, Tang et al. [9] proposed a new class of graphs called generalized recursive circulant (GRC) graphs, which is an extension of recursive circulant graphs. GRC graphs have a more flexible structure than recursive circulant graphs, while retaining their attractive properties, such as degree, connectivity, diameter, and routing algorithm. In this paper, the Hamiltonian decomposition of some GRC graphs is discussed. (C) 2016 Elsevier B.V. All rights reserved. |
URI: | http://dx.doi.org/10.1016/j.ipl.2016.04.003 http://hdl.handle.net/11536/133866 |
ISSN: | 0020-0190 |
DOI: | 10.1016/j.ipl.2016.04.003 |
Journal: | INFORMATION PROCESSING LETTERS |
Volume: | 116 |
Issue: | 9 |
Begin Page: | 585 |
End Page: | 589 |
Appears in Collections: | Articles |