A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.

The paper considers a generalization of the well known random placement of balls into bins. Given n circular arcs of lengths 1, : : : ,n we study the maximum number of overlapping arcs on a circle if the starting points of the arcs are chosen randomly. We give almost exact tail bounds on the maximum overlap of the arcs. These tail bounds yield a characterization of the expected maximum overlap ...

We classify the arcs in PG(2, q), q odd, which consist of (q + 3)/2 points of a conic C and two points not on te conic but external to C, or (q + 1)/2 points of C and two additional points, at least one of which is an internal point of C. We prove that for arcs of the latter type, the number of points internal to C can be at most 4, and we give a complete classification of all arcs that attain ...

By using a magnetosphere-ionosphere (M-I) coupling model of polar cap arcs [Zhu et al., 1993], a systematic model study of the effects of ionospheric background conductivity on the formation of polar cap arcs has been conducted. The variations of the ionospheric background conductivity in the model study cover typical ionospheric onditions, including solar minimum, solar maximum, winter, and su...