2021/11/15 by I. Kovács, Kovács, István, János Ruff +1
Computer Science · Engineering · Mathematics · #05C25 #20B25 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2111.07982
openalex publication_date 2021/11/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 6 (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.