Hamiltonian decomposition of generalized recursive circulant graphs

•GRC graphs have more flexible structures than recursive circulant graphs.•We construct edge-disjoint Hamiltonian cycles of GRC graphs.•We prove that some of the GRC graphs are Hamiltonian decomposable. In 2012, Tang et al. [9] proposed a new class of graphs called generalized recursive circulant (G...

Full description

Saved in:
Bibliographic Details
Published in:Information processing letters 2016-09, Vol.116 (9), p.585-589
Main Authors: Chen, Y-Chuang, Tsai, Tsung-Han
Format: Article
Language:English
Subjects:
Algorithms
Circulant graph
Data processing
Decomposition
Fault tolerance
Flexible structures
Generalized recursive circulant graph
Graph algorithms
Graph theory
Graphs
Hamiltonian decomposition
Internet access
Recursive
Recursive circulant graph
Routing
Studies
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:•GRC graphs have more flexible structures than recursive circulant graphs.•We construct edge-disjoint Hamiltonian cycles of GRC graphs.•We prove that some of the GRC graphs are Hamiltonian decomposable. 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.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2016.04.003