On 2-transitive graphs of girth 5
type: Item
instance of: scholarly article
title: On 2-transitive graphs of girth 5
zbMATH Open document ID: 0645.05043
DOI: 10.1016/S0195-6698(87)80047-1
published in: European Journal of Combinatorics
publication date: 1987-01-01T00:00:00Z
review text: A graph \(\Gamma\) is said to be 2-transitive if its automorphism group G acts transitively on the set of 2-paths of \(\Gamma\) but intransitively on the set of 3-paths. Suppose that the 2-transitive graph \(\Gamma\) satisfies: (1) for any vertex x, the action of the stabilizer G(x) on the set of neighbors of x is doubly-transitive with no regular normal subgroup, and (2) the subgroup of G(x) fixing pointwise every neighbor of x is nontrivial. \textit{C. E. Praeger} [Combinat. Math. IX, Proc. 9th Austr. Conf. 1981, Lect. Notes Math. 952, 123-141 (1982; Zbl 0494.05028)] claimed that \(\Gamma\) must have girth less than 5. The author constructs finite and infinite counterexamples, all having girth 5. In the finite counterexamples, possibilities for G include \(M_{22}\), \(Co_ 2\), \(J_ 4\), and Fischer's group \(F_ 2.\) In a self-contained subinvestigation, it is shown that a graph of girth 5 in which every pair of vertices lying at distance 2 apart belong to exactly m 5-circuits, while no 6-circuit contains only shortest paths, contains \((m+1)\)-valent Moore graphs of diameter 2, where \(m\in \{1,2,6,56\}.\) This paper requires familiarity with the classification of finite group, combinatorial designs, and codes in addition to algebraic graph theory. Unfortunately the author's unfamiliarity with English syntax, usage, and grammar, together with occasional mathematical misprints, render it difficult to read.
reviewed by: Mark E. Watkins
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 20B25
Mathematics Subject Classification ID: 20D06
Mathematics Subject Classification ID: 05B07
zbMATH DE Number: 4051665
zbMATH Keywords: distance-transitive
zbMATH Keywords: group amalgam
zbMATH Keywords: Moore graph
zbMATH Keywords: Mathieu groups
zbMATH Keywords: automorphism group
zbMATH Keywords: girth
author: Alexander A. Ivanov
MaRDI profile type: Publication
cites work: The nonexistence of rank three permutation groups of degree 3250 and subdegree 57
cites work: A new 5‐arc‐transitive cubic graph
cites work: Automorphic graphs and the Krein condition
cites work: Q3050438
cites work: Q5580319
cites work: Diagrams for geometries and groups
cites work: Q3697813
cites work: Q4050760
cites work: Finite Permutation Groups and Finite Simple Groups
cites work: Graphs and Permutation Groups with Projective Subconstituents
cites work: On 2-arc transitive graphs of girth 4
cites work: Presentations for the simple groups g, l05≪ |g| < 106
cites work: Q4284645
cites work: Q3251484
cites work: Automorphisms of trivalent graphs
cites work: The friendly giant
cites work: Quotients of infinite reflection groups
cites work: Distance-transitive graphs of valency 5, 6 and 7
cites work: Geometries for sporadic groups related to the petersen graph. I
cites work: Q3487414
cites work: A geometry for the O'Nan-Sims group connected with the Petersen graph
cites work: A new finite simple group of order 86,775,571,046,077,562,880 which possesses \(M_{24}\) and the full covering group of \(M_{22}\) as subgroups
cites work: Q4404928
cites work: Steiner triple systems with doubly transitive automorphism groups: A corollary to the classification theorem for finite simple groups
cites work: Q5583892
cites work: Q5650865
cites work: A 2-local characterization of Janko's simple group \(J_4\).
cites work: Bounding the Valency of Polygonal Graphs With Odd Girth
cites work: A Characterization of PSL(2, 31) and its Geometry
cites work: A characterization of \(J_1\) in terms of its geometry
cites work: Q3956971
cites work: Primitive permutation groups and a characterization of the odd graphs
cites work: Q3809987
cites work: Near \(n\)-gons and line systems
cites work: On graphs with edge-transitive automorphism groups
cites work: Kantentransitive Graphen und Gruppen vom Rang 2. (Edge transitive graphs and groups of rank 2)
cites work: Distance-regular graphs and (s,c,a,k)-graphs
cites work: Q5785712
cites work: On the Symmetry of Cubic Graphs
cites work: Groups with a (B, N)–pair and locally transitive graphs
cites work: Q3931422
cites work: Q5512231
cites work: Determination of a class of primitive permutation groups
Recommended article: Vertex-transitive diameter two graphs
Recommended article: Constructing 4-valent \(\frac 12\)-transitive graphs with a nonsolvable automorphism group
Recommended article: Q4710916
Recommended article: Distance Transitive Graphs and Finite Simple Groups
Recommended article: A �-transitive graph of valency 4 with a nonsolvable group of automorphisms
Recommended article: On distance transitive graphs in which the stabilizer of a point contains an alternating group
Recommended article: Q3679219
Recommended article: Approaching the Moore bound for diameter two by Cayley graphs
Recommended article: Pentavalent vertex-transitive diameter two graphs
Recommended article: Q3974692
description: scientific article; zbMATH DE number 4051665