A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive

Details A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive

2007-03-29

arxiv.org/abs/math/0703861v1

Mathematics

Combinatorics

Version dated 1985; GNU FDL

Scientific paper

I describe a 27-vertex graph that is vertex-transitive and edge-transitive
but not 1-transitive. Thus while all vertices and edges of this graph are
similar, there are no edge-reversing automorphisms.

Affiliated with

Also associated with

No associations

Rating

A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive 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 A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-711232