Title of article
Descendants in highly arc transitive digraphs Original Research Article
Author/Authors
R?gnvaldur G. M?ller، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2002
Pages
11
From page
147
To page
157
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.
Keywords
Highly arc transitive , Digraphs , Automorphism groups , Growth , Trees
Journal title
Discrete Mathematics
Serial Year
2002
Journal title
Discrete Mathematics
Record number
950006
Link To Document