A zero-symmetric graph is a vertex-transitivecubic graph whose edges are partitioned into three orbits
by its automorphism group. The figures above
show some small zero-symmetric graphs.
An embedding of the smallest zero-symmetric graph appears on the cover of Coxeter
et al. (1981) and on p. 5.