Set-homogeneous directed graphs

Details Set-homogeneous directed graphs Set-homogeneous directed graphs

2010-11-18

arxiv.org/abs/1011.4216v1

Mathematics

Combinatorics

43 pages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Set-homogeneous directed graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Set-homogeneous directed graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Set-homogeneous directed graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-537014