Kautz graph

from Wikipedia, the free encyclopedia

The Kautz graph , named after William H. Kautz (* 1924), is a digraph ( directed graph ) of degree and dimension with corners. The corners are marked with all possible character strings of the length of characters of the alphabet that contain different symbols, with the restriction that adjacent characters in the character string must not be the same ( for ).

The Kautz graph has directed edges

Usually these edges are marked with , which gives a 1: 1 correspondence between the edges of the Kautz graph and corners of the Kautz graph .

Kautz graphs are closely related to De Bruijn graphs .

properties

  • For fixed degrees and number of vertices , the Kautz graph has the smallest possible diameter of a directed graph with vertices and degrees .
  • All Kautz graphs have directed Euler circles
  • All Kautz graphs have a directed Hamiltonian circle
  • A Grad- Kautz graph has unconnected directed paths from any node to any other node .

literature

  • WH Kautz: Bounds on directed (d, k) graphs , Theory of cellular logic networks and machines, AFCRL-68-0668 SRI Project 7258 Final report, 1968, pp. 20-28
  • WH Kautz: Design of optimal interconnection networks for multiprocessors , Architecture and design of digital computers, Nato Advanced Summer Institute, 1969, pp. 249-272.

Web links