The Hamiltonian Property of the Consecutive-3 Digraph


A consecutive-d digraph is a digraph G(d, n, q, T) whose n nodes are labeled by the residues modulo n and a link from node i to node j exists if and only if j I pi + k (mod n) for some k with r 5 k 5 r + d 1. Consecutive-d digraphs are used as models for many computer networks and multiprocessor systems, in which the existence of a Hamiltonian circuit is… (More)


3 Figures and Tables

Slides referencing similar topics