Pentavalent symmetric graphs of order 30p

18Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

A complete classification is given of pentavalent symmetric graphs of order 30 p, where p ≥ 5 is a prime. It is proved that such a graph Γ exists if and only if p = 13 and, up to isomorphism, there is only one such graph. Furthermore, Γ is isomorphic to C390, a coset graph of PSL(2, 25) with AutΓ = PSL(2, 25), and Γ is 2-regular. The classification involves a new 2-regular pentavalent graph construction with square-free order.

References Powered by Scopus

The Magma algebra system I: The user language

4941Citations
N/AReaders
Get full text

Vertex-transitive graphs

262Citations
N/AReaders
Get full text

An O'Nan-Scott theorem for finite quasiprimitive permutation groups and an application to 2-arc transitive graphs

242Citations
N/AReaders
Get full text

Cited by Powered by Scopus

Pentavalent symmetric graphs of order 2pqr

14Citations
N/AReaders
Get full text

Arc-Transitive Pentavalent Graphs of Square-Free Order

7Citations
N/AReaders
Get full text

Symmetric graphs and interconnection networks

5Citations
N/AReaders
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Ling, B., Wu, C. X., & Lou, B. G. (2014). Pentavalent symmetric graphs of order 30p. Bulletin of the Australian Mathematical Society, 90(3), 353–362. https://doi.org/10.1017/S0004972714000616

Readers' Seniority

Tooltip

Professor / Associate Prof. 1

33%

Lecturer / Post doc 1

33%

Researcher 1

33%

Readers' Discipline

Tooltip

Mathematics 2

67%

Agricultural and Biological Sciences 1

33%

Save time finding and organizing research with Mendeley

Sign up for free