Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Cubic edge-transitive bi-$p$-metacirculant (1610.07307v1)

Published 24 Oct 2016 in math.CO

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

We haven't generated a summary for this paper yet.