Set-homogeneous directed graphs

Citations of this article
Mendeley users who have this article in their library.


A directed graph is set-homogeneous if, whenever U and V are isomorphic finite subdigraphs, there is an automorphism g of the digraph with U g=V. Here, extending work of Lachlan on finite homogeneous digraphs, we classify finite set-homogeneous digraphs, where we allow some pairs of vertices to have arcs in both directions. Under the assumption that such pairs of vertices are not allowed, we obtain initial results on countably infinite set-homogeneous digraphs, classifying those which are not 2-homogeneous. © 2011 Elsevier Inc..




Gray, R., Macpherson, D., Praeger, C. E., & Royle, G. F. (2012). Set-homogeneous directed graphs. Journal of Combinatorial Theory. Series B, 102(2), 474–520.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free