A classification of connected-homogeneous digraphs
Combinatorics
2010-04-30 v1
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.
Cite
@article{arxiv.1004.5273,
title = {A classification of connected-homogeneous digraphs},
author = {Matthias Hamann and Fabian Hundertmark},
journal= {arXiv preprint arXiv:1004.5273},
year = {2010}
}
Comments
23 pages, 2 figures