出典:Wikipedia
出典:『Wikipedia』 (2010/09/21 17:35 UTC 版)
The Kautz graph
is a directed graph of degree M and dimension N + 1, which has (M + 1)MN vertices labeled by all possible strings
of length N + 1 which are composed of characters si chosen from an alphabet A containing M + 1 distinct symbols, subject to the condition that adjacent characters in the string cannot be equal (
).