A classification of connected-homogeneous digraphs
classification
🧮 math.CO
keywords
connected-homogeneousdigraphsclassificationclassifyfurthergraphhighly-arc-transitivethey
read the original abstract
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.