Abstract | ||
---|---|---|
Given a finite set V and a set S of permutations of V, the group action graph GAG(V,S) is the digraph with vertex set V and arcs (v, v(sigma)) for all v is an element of V and sigma is an element of S. Let < S > be the group generated by S. The Cayley digraph Cay(< S >, S) is called a Cayley cover of GAG(V, S). We define the Kautz digraphs as group action graphs and give an explicit construction of the corresponding Cayley cover. This is an answer to a problem posed by Heydemann in 1996. |
Year | Venue | Field |
---|---|---|
2011 | ELECTRONIC JOURNAL OF COMBINATORICS | Graph,Discrete mathematics,Combinatorics,Finite set,Vertex (geometry),Permutation,Sigma,Digraph,Mathematics |
DocType | Volume | Issue |
Journal | 18.0 | 1.0 |
ISSN | Citations | PageRank |
1077-8926 | 0 | 0.34 |
References | Authors | |
8 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Josep M. Brunat | 1 | 42 | 5.52 |