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

Simple item page
dc.creatorDoyle, Peter G.
dc.date2007-03-29
dc.date.accessioned2026-07-07T07:55:02Z
dc.date.available2026-07-07T07:55:02Z
dc.descriptionI 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.
dc.descriptionVersion dated 1985; GNU FDL
dc.identifierhttps://arxiv.org/abs/math/0703861
dc.identifierhttp://arxiv.org/abs/math/0703861
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/126836
dc.subjectCombinatorics
dc.titleA 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive
dc.typetext

Files

Collections

arXiv