|igraph Reference Manual|
int igraph_kautz(igraph_t *graph, igraph_integer_t m, igraph_integer_t n);
A Kautz graph is a labeled graph, vertices are labeled by strings
n+1 above an alphabet with
m+1 letters, with
the restriction that every two consecutive letters in the string
must be different. There is a directed edge from a vertex
w if it is possible to transform the string of
v into the string of
w by removing the first letter and
appending a letter to it.
Kautz graphs have some interesting properties, see eg. Wikipedia for details.
Vincent Matossian wrote the first version of this function in R, thanks.
Pointer to an uninitialized graph object, the result will be stored here.
Time complexity: O(|V|* [(m+1)/m]^n +|E|), in practice it is more
like O(|V|+|E|). |V| is the number of vertices, |E| is the number
of edges and
n are the corresponding arguments.