On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq

A graph is said to be symmetric if its automorphism group is transitive on its arcs. This article is one of a series of articles devoted to characterizing prime-valent arc-transitive graphs of square-free order or twice square-free order. In this article, we determine all 7-valent symmetric graphs o...

Full description

Saved in:
Bibliographic Details
Published in:Open mathematics (Warsaw, Poland) Poland), 2022-12, Vol.20 (1), p.1696-1708
Main Authors: Ling, Bo, Lan, Ting, Ding, Suyun
Format: Article
Language:English
Subjects:
05C25
05E18
automorphism group
Automorphisms
Graphs
normal quotient
symmetric graph
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:A graph is said to be symmetric if its automorphism group is transitive on its arcs. This article is one of a series of articles devoted to characterizing prime-valent arc-transitive graphs of square-free order or twice square-free order. In this article, we determine all 7-valent symmetric graphs of order 2 and 11-valent symmetric graphs of order 4
ISSN:2391-5455
DOI:10.1515/math-2022-0528