English

Trivalent dihedrants and bi-dihedrants

Combinatorics 2019-06-25 v1

Abstract

A Cayley (resp. bi-Cayley) graph on a dihedral group is called a {\em dihedrant} (resp. {\em bi-dihedrant}). In 2000, a classification of trivalent arc-transitive dihedrants was given by Maru\v si\v c and Pisanski, and several years later, trivalent non-arc-transitive dihedrants of order 4p4p or 8p8p (p(p a prime) were classified by Feng et al. As a generalization of these results, our first result presents a classification of trivalent non-arc-transitive dihedrants. Using this, a complete classification of trivalent vertex-transitive non-Cayley bi-dihedrants is given, thus completing the study of trivalent bi-dihedrants initiated in our previous paper [Discrete Math. 340 (2017) 1757--1772]. As a by-product, we generalize a theorem in [The Electronic Journal of Combinatorics 19 (2012) #\#P53].

Keywords

Cite

@article{arxiv.1906.09367,
  title  = {Trivalent dihedrants and bi-dihedrants},
  author = {Mi-Mi Zhang and Jin-Xin Zhou},
  journal= {arXiv preprint arXiv:1906.09367},
  year   = {2019}
}
R2 v1 2026-06-23T10:00:29.068Z