The Kautz graph is a directed graph of degree and dimension 
, which has vertices labeled by all possible strings of length which are composed of characters chosen from an alphabet containing distinct symbols, subject to the condition that adjacent characters in the string cannot be equal .
The Kautz graph has 
edges
It is natural to label each such edge of as, giving a one-to-one correspondence between edges of the Kautz graph and vertices of the Kautz graph .
Kautz graphs are closely related to De Bruijn graphs.
Read more about Kautz Graph: Properties, In Computing
Famous quotes containing the word graph:
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)