Papers
Topics
Authors
Recent
Search
2000 character limit reached

Cubic edge-transitive bi-$p$-metacirculant

Published 24 Oct 2016 in math.CO | (1610.07307v1)

Abstract: A graph is said to be a bi-Cayley graph over a group H if it admits H as a group of automorphisms acting semiregularly on its vertices with two orbits. For a prime p, we call a bi-Cayley graph over a metacyclic p-group a bi-p-metacirculant. In this paper, the automorphism group of a connected cubic edge-transitive bi-p-metacirculant is characterized for an odd prime p, and the result reveals that a connected cubic edge-transitive bi-p-metacirculant exists only when p=3. Using this, a classification is given of connected cubic edge-transitive bi-Cayley graphs over an inner-abelian metacyclic 3-group. As a result, we construct the first known infinite family of cubic semisymmetric graphs of order twice a 3-power.

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.