Hamiltonian decomposition of generalized recursive circulant graphs

被引:2
作者
Chen, Y-Chuang [1 ]
Tsai, Tsung-Han [2 ]
机构
[1] Minghsin Univ Sci & Technol, Dept Informat Management, Hsinchu 30401, Taiwan
[2] Natl Chiao Tung Univ, Dept Comp Sci, Hsinchu 300, Taiwan
关键词
Fault tolerance; Hamiltonian decomposition; Circulant graph; Recursive circulant graph; Generalized recursive circulant graph;
D O I
10.1016/j.ipl.2016.04.003
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:585 / 589
页数:5
相关论文
共 10 条