Hamiltonian Decomposition of Some Interconnection Networks

Authors:
Hai-Zhong Shi;Pan-Feng Niu
Affiliations:
College of Mathematics and Information Science, Northwest Normal University, Lanzhou, China 730070;College of Mathematics and Information Science, Northwest Normal University, Lanzhou, China 730070
Venue:
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Year:
2009

Citing 8
Cited 1

The cosmic cube

Communications of the ACM - Special section on computer architecture
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
The Hamiltonian property of generalized de Bruijn digraphs

Journal of Combinatorial Theory Series B
Analysis of interconnection networks based on Cayley graphs related to permutation groups

Analysis of interconnection networks based on Cayley graphs related to permutation groups
Hamiltonian cycles and paths in Cayley graphs and digraphs—a survey

Discrete Mathematics
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications

Graph Theory With Applications
Generalized Hypercube and Hyperbus Structures for a Computer Network

IEEE Transactions on Computers

One conjecture of bubble-sort graphs

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Cayley graphs arise naturally in interconnection networks design in study of Akers and Krishnamurthy in 1989 [1]. Lakshmivarahan, Jwo and Dhall studied a number of interconnection networks as graphs in 1993 [12]. In this paper, we propose some conjectures related to complete-transposition graph, alternating-group graph, folded hypercube and binary orthogonal graph, respectively. The conjectures claim that each of these graphs is Hamiltonian decomposable. In addition, we prove that above conjectures are true for smaller order of the networks.