Abstract | ||
---|---|---|
A general method for constructing sharply k-arc-transitive digraphs, i.e. digraphs that are k-arc-transitive but not (k+1)-arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples. The infinite examples can have one, two or infinitely many ends. Among the one-ended examples there are also digraphs that have polynomial growth. |
Year | DOI | Venue |
---|---|---|
2019 | 10.1016/j.disc.2018.11.001 | Discrete Mathematics |
Keywords | DocType | Volume |
Digraphs,Automorphism groups,Arc-transitivity,Highly-arc-transitive | Journal | 342 |
Issue | ISSN | Citations |
3 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Rögnvaldur G. Möller | 1 | 35 | 6.28 |
primož potocnik | 2 | 71 | 12.51 |
N Seifter | 3 | 137 | 26.49 |