Construction of Hamiltonian Circuits in Cayley Graphs Modeling Multiprocessing Computer Systems

Authors:
P. P. Parkhomenko
Affiliations:
Trapeznikov Institute of Control Sciences, Russian Academy of Sciences, Moscow, Russia
Venue:
Automation and Remote Control
Year:
2002

Citing 4
Cited 2

Cayley Graphs With Optimal Fault Tolerance

IEEE Transactions on Computers
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four

IEEE Transactions on Parallel and Distributed Systems
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees

IEEE Transactions on Parallel and Distributed Systems
Classification of the Hamiltonian Cycles in Binary Hypercubes

Automation and Remote Control

Composition and distribution of resources for real-time computing systems

Automation and Remote Control
Combinatorial methods for constructing bipartite uniform minimal quasicomplete graphs (symmetrical block designs)

Automation and Remote Control

Quantified Score

Hi-index	0.00

Visualization

Abstract

The edge representation of circuits in in-dimensional binary hypercubes, which is put forward in [1], is extended to a number of other Cayley graphs that differ in the finite groups determining the sets of their vertices and in the permutations of the numbers of vertices, which prescribe their edges. The construction of Hamiltonian circuits represented by sequences of the weights of edges is considered. The weight of an edge is its characteristic associated with a grouped generating function inducing the given edge.