Vertex-Primitive graphs of order a product of two distinct primes

111Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Let k and p be odd primes with k < p. All vertex-primitive graphs of order kp are classified, and those which are symmetric, or are edge-transitive but not symmetric. or are not Cayley graphs are identified. In addition, a classification is given of all vertex-primitive, edge-transitive lantisymmetric) directed graphs or order kp. The classification of the vertex-primitive symmetric graphs of order kp is used by the authors and others to complete the classification of symmetric graphs or order kp. The classification of the vertex-primitive non-Cayley graphs of order kp is used by B.D. McKay and the first author in an investigation of vertex-transitive non-Cayley graphs. © 1993 by Academic Press, Inc.

Cite

CITATION STYLE

APA

Praeger, C. E., & Xu, M. Y. (1993). Vertex-Primitive graphs of order a product of two distinct primes. Journal of Combinatorial Theory, Series B, 59(2), 245–266. https://doi.org/10.1006/jctb.1993.1068

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free