Locally arc-transitive graphs of valence {3,4}\{3,4\} with trivial edge kernel

In this paper we consider connected locally $G$-arc-transitive graphs with vertices of valence 3 and 4, such that the kernel $G_{uv}^{[1]}$ of the action of an edge-stabiliser on the neighourhood $\Gamma(u) \cup \Gamma(v)$ is trivial. We find nineteen finitely presented groups with the property that any such group $G$ is a quotient of one of these groups. As an application, we enumerate all connected locally arc-transitive graphs of valence ${3,4}$ on at most 350 vertices whose automorphism group contains a locally arc-transitive subgroup $G$ with $G_{uv}^{[1]} = 1$

Families of Small Regular Graphs of Girth 5

In this paper we obtain $(q+3)$--regular graphs of girth 5 with fewer vertices than previously known ones for $q=13,17,19$ and for any prime $q \ge 23$ performing operations of reductions and amalgams on the Levi graph $B_q$ of an elliptic semiplane of type ${\cal C}$. We also obtain a 13-regular graph of girth 5 on 236 vertices from $B_{11}$ using the same technique

Semisymmetric cubic graphs of twice odd order

The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph

A characterisation of weakly locally projective amalgams related to A16A_{16} and the sporadic simple groups M24M_{24} and HeHe

A simple undirected graph is weakly $G$-locally projective, for a group of automorphisms $G$, if for each vertex $x$, the stabiliser $G(x)$ induces on the set of vertices adjacent to $x$ a doubly transitive action with socle the projective group $L_{n_x}(q_x)$ for an integer $n_x$ and a prime power $q_x$. It is $G$-locally projective if in addition $G$ is vertex transitive. A theorem of Trofimov reduces the classification of the $G$-locally projective graphs to the case where the distance factors are as in one of the known examples. Although an analogue of Trofimov's result is not yet available for weakly locally projective graphs, we would like to begin a program of characterising some of the remarkable examples. We show that if a graph is weakly locally projective with each $q_x =2$ and $n_x = 2$ or $3$, and if the distance factors are as in the examples arising from the rank 3 tilde geometries of the groups $M_{24}$ and $He$, then up to isomorphism there are exactly two possible amalgams. Moreover, we consider an infinite family of amalgams of type $\mathcal{U}_n$ (where each $q_x=2$ and $n=n_x+1\geq 4$) and prove that if $n\geq 5$ there is a unique amalgam of type $\mathcal{U}_n$ and it is unfaithful, whereas if $n=4$ then there are exactly four amalgams of type $\mathcal{U}_4$, precisely two of which are faithful, namely the ones related to $M_{24}$ and $He$, and one other which has faithful completion $A_{16}$