Every branch of mathematics employs some notion of a product that enables the com-
bination or decomposition of its elemental structures. In graph theory there are four main …

The theory of directed graphs has developed enormously over recent decades, yet this book
(first published in 2000) remains the only book to cover more than a small fraction of the …

A brilliant treatment of a knotty problem in computing. This volume contains chapters written
by reputable researchers and provides the state of the art in theory and algorithms for the …

A combinatorial Gray code for a class of objects is a listing that contains each object from the
class exactly once such that any two consecutive objects in the list differ only by asmall …

This paper is a survey of existing methods of communication in usual networks. We
particularly study the complete network, the ring, the torus, the grid, the hypercube, the cube …

Humanity has long enjoyed making lists. All children delight in their new-found ability to
count 1, 2, 3, etc., and it is a profound revelation that this process can be carried out …

This survey paper presents the historical development of some problems on Cayley graphs
which are interesting to graph and group theorists such as Hamiltonicity or diameter …

Cayley graphs arise naturally in computer science, in the study of word-hyperbolic groups
and automatic groups, in change-ringing, in creating Escher-like repeating patterns in the …

A long-standing conjecture of Kelly states that every regular tournament on n vertices can be
decomposed into (n− 1)/2 edge-disjoint Hamilton cycles. We prove this conjecture for large …

Generating diverse populations of high-quality solutions has gained interest as a promising
extension to the traditional optimization tasks. This work contributes to this line of research …