Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Hamiltonian cycles and paths in Cayley graphs and digraphs—a survey
Discrete Mathematics
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Directed Hamiltonian Packing in d-Dimensional Meshes and Its Application (Extended Abstract)
ISAAC '96 Proceedings of the 7th International Symposium on Algorithms and Computation
Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science
Hamiltonian Decomposition of Recursive Circulants
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Graph Theory With Applications
Graph Theory With Applications
Analysis of Chordal Ring Network
IEEE Transactions on Computers
| Hi-index | 0.00 |
We consider the dihamiltonian decomposition problem for 3- regular graphs. A graph G is dihamiltonian decomposable if in the digraph obtained from G by replacing each edge of G as two directed edges, the set of edges are partitioned into 3 edge-disjoint directed hamiltonian cycles. We suggest some conditions for dihamiltonian decomposition of 3-regular graphs: for a 3-regular graph G, it is dihamiltonian decomposable only if it is bipartite, and it is not dihamiltonian decomposable if the number of vertices is a multiple of 4. Applying these conditions to interconnection network topologies, we investigate dihamiltonian decomposition of cube-connected cycles, chordal rings, etc.