Descendants in highly arc transitive digraphs Rögnvaldur

G. Möller*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

21 Citations (Scopus)

Abstract

A digraph is said to be highly arc transitive if its automorphism group acts transitively on the set of s-arcs for all s > 0. The set of descendants of a directed line is defined as the set of all vertices that can be reached by a directed path from some vertex in the line. The structure of the subdigraph in a locally finite highly arc transitive digraph spanned by the set of descendants of a line is described and this knowledge is used to answer a question of Cameron, Praeger and Wormald. In addition another question of Cameron, Praeger and Wormald is settled.

Original languageEnglish
Pages (from-to)147-157
Number of pages11
JournalDiscrete Mathematics
Volume247
Issue number1-3
DOIs
Publication statusPublished - 28 Mar 2002

Other keywords

  • Automorphism groups
  • Digraphs
  • Growth
  • Highly arc transitive
  • Trees

Fingerprint

Dive into the research topics of 'Descendants in highly arc transitive digraphs Rögnvaldur'. Together they form a unique fingerprint.

Cite this