ﻻ يوجد ملخص باللغة العربية
A graph is edge-primitive if its automorphism group acts primitively on the edge set, and 2-arc-transitive if its automorphism group acts transitively on the set of 2-arcs. In this paper, we present a classification for those edge-primitive graphs which are 2-arc-transitive and have soluble edge-stabilizers.
This paper begins the classification of all edge-primitive 3-arc-transitive graphs by classifying all such graphs where the automorphism group is an almost simple group with socle an alternating or sporadic group, and all such graphs where the automo
A graph is edge-primitive if its automorphism group acts primitively on the edge set. In this short paper, we prove that a finite 2-arc-transitive edge-primitive graph has almost simple automorphism group if it is neither a cycle nor a complete bipar
Building on earlier work of Biggs, James, Wilson and the author, and using the Graver-Watkins description of the 14 classes of edge-transitive maps, we complete the classification of the edge-transitive embeddings of complete graphs.
Let $G$ be a transitive permutation group on a finite set $Omega$ and recall that a base for $G$ is a subset of $Omega$ with trivial pointwise stabiliser. The base size of $G$, denoted $b(G)$, is the minimal size of a base. If $b(G)=2$ then we can st
We investigate the number of 4-edge paths in graphs with a fixed number of vertices and edges. An asymptotically sharp upper bound is given to this quantity. The extremal construction is the quasi-star or the quasi-clique graph, depending on the edge