A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive
Peter G. Doyle
math.COarXiv:math/0703861
Abstract
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.
Create a lesson
Related papers
The λ-chain condition of a finite partially ordered set
Takayuki Hibi, Sora Miyashita
Two Linear Programs are Better than One
Alexander E. Black, Christoph Hertrich, Stefan Kober et al.
A note on the Slaterx2013Vélez permutation
Andreas Floros
Universal Shift Congruences for Weighted Permutation Sequences
Ahaan Kallat
Bipartite edge frustration of nut graphs: proofs and constructions
Nino Bašić, Patrick W. Fowler
Covering powers of cycles with equivalence subgraphs
Zhanping Yang