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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
