On Locally Projective Graphs of Girth 5

نویسنده

  • CHERYL E. PRAEGER
چکیده

Let0 be a graph and G be a 2-arc transitive automorphism group of0. For a vertex x ∈ 0 let G(x)0(x) denote the permutation group induced by the stabilizer G(x) of x in G on the set 0(x) of vertices adjacent to x in 0. Then 0 is said to be a locally projective graph of type (n, q) if G(x)0(x) contains PSLn(q) as a normal subgroup in its natural doubly transitive action. Suppose that 0 is a locally projective graph of type (n, q), for some n ≥ 3, whose girth (that is, the length of a shortest cycle) is 5 and suppose that G(x) acts faithfully on 0(x). (The case of unfaithful action was completely settled earlier.) We show that under these conditions either n = 4, q = 2, 0 has 506 vertices and G ∼= M23, or q = 4, PSLn(4) ≤ G(x) ≤ PGLn(4), and 0 contains the Wells graph on 32 vertices as a subgraph. In the latter case if, for a given n, at least one graph satisfying the conditions exists then there is a universal graph W (n) of which all other graphs for this n are quotients. The graph W (3) satisfies the conditions and has 220 vertices.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

(5, 2)-Coloring of Sparse Graphs

We prove that every triangle-free graph whose subgraphs all have average degree less than 12/5 has a (5, 2)-coloring. This includes planar and projective-planar graphs with girth at least 12. Also, the degree result is sharp; we construct a minimal non(5, 2)-colorable triangle-free graph with 10 vertices that has average degree 12/5.

متن کامل

Symmetric Cubic Graphs of Girth at Most 7

By a symmetric graph we mean a graph X which automorphism group acts transitively on the arcs of X. A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Tutte [31, 32] showed that every finite symmetric cubic graph is s-regular for some s ≤ 5. It is well-known that there are precisely five symmetric cubic graphs of girth less than 6. All these graphs can be re...

متن کامل

On regular graphs of girth six arising from projective planes

In 1967, Brown constructed small k-regular graphs of girth six as induced subgraphs of the incidence graph of a projective plane of order q, q ≥ k. Examining the construction method, we prove that starting from PG(2, q), q = p, p prime, there are no other constructions using this idea resulting in a (q + 1− t)-regular graph of girth six than the known ones, if t is not too large (t ≤ p and roug...

متن کامل

The Endomorphism Type of Certain Bipartite Graphs and a Characterization of Projective Planes

In [2] Fan determines the endomorphism type of a finite projective plane. In this note we show that Fan’s result actually characterizes the class of projective planes among the finite bipartite graphs of diameter three. In fact, this will follow from a generalization of Fan’s theorem and its converse to all finite bipartite graphs with diameter d and girth g such that (1) d + 1 < g ≤ 2d, and (2...

متن کامل

Incidence Matrices of Projective Planes and of Some Regular Bipartite Graphs of Girth 6 with Few Vertices

Let q be a prime power and r = 0, 1 . . . , q − 3. Using the Latin squares obtained by multiplying each entry of the addition table of the Galois field of order q by an element distinct from zero, we obtain the incidence matrices of projective planes and the incidence matrices of (q− r)-regular bipartite graphs of girth 6 and q − rq− 1 vertices in each partite set. Moreover, in this work two La...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998