On certain edge-transitive bicirculants of twice odd order
Combinatorics
2021-11-16 v1
Abstract
A graph admitting an automorphism with two orbits of the same length is called a bicirculant. Recently, Jajcay et al. initiated the investigation of the edge-transitive bicirculants with the properties that one of the subgraphs induced by the latter orbits is a cycle and the valence is at least (Electron. J. Combin., 2019). We show that the complement of the Petersen graph is the only such graph whose order is twice an odd number.
Keywords
Cite
@article{arxiv.2111.07982,
title = {On certain edge-transitive bicirculants of twice odd order},
author = {István Kovács and János Ruff},
journal= {arXiv preprint arXiv:2111.07982},
year = {2021}
}