Skip to Content
You are currently on the new version of our website. Access the old version .
MathematicsMathematics
  • Article
  • Open Access

7 March 2024

10 Pages

Classifying Seven-Valent Symmetric Graphs of Order 8pq

,
,
and
School of Mathematics and Computer Science, Yunnan Minzu University, Kunming 650031, China
*
Author to whom correspondence should be addressed.

Abstract

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 8p for each prime p. We shall generalize this result by determining all of the connected seven-valent symmetric graphs of order 8pq with p and q to be distinct primes. As a result, we show that for each such graph of Γ, it is isomorphic to one of seven graphs.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.