Papers
Topics
Authors
Recent
Search
2000 character limit reached

Trivalent dihedrants and bi-dihedrants

Published 22 Jun 2019 in math.CO | (1906.09367v1)

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 $4p$ or $8p$ $(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].

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.