Classifying Seven-Valent Symmetric Graphs of Order 8<i>pq</i>
A graph is symmetric if its automorphism group is transitive on the arcs of the graph. Guo et al. determined all of the connected seven-valent symmetric graphs of order <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics>...
Main Authors: | Yingbi Jiang, Bo Ling, Jinlong Yang, Yun Zhao |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2024-03-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | https://www.mdpi.com/2227-7390/12/6/787 |
Similar Items
-
On 7-valent symmetric graphs of order 2pq and 11-valent symmetric graphs of order 4pq
by: Ling Bo, et al.
Published: (2022-12-01) -
Classification of the pentavalent symmetric graphs of order $8pq$
by: Masoumeh Akbarizadeh, et al.
Published: (2022-12-01) -
Classifying cubic symmetric graphs of order 52p2; pp. 55–60
by: Shangjing Hao, et al.
Published: (2023-02-01) -
Automorphism groups of some families of bipartite graphs
by: K.G. Sreekumar, et al.
Published: (2021-04-01) -
Fixing Numbers of Point-Block Incidence Graphs
by: Josephine Brooks, et al.
Published: (2023-03-01)