Related papers: Vertex-primitive s-arc-transitive digraphs admitti…

Let $G$ be a group. The intersection graph of subgroups of $G$, denoted by $\mathscr{I}(G)$, is a graph with all the proper subgroups of $G$ as its vertices and two distinct vertices in $\mathscr{I}(G)$ are adjacent if and only if the…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Among the infinite classes of finite simple groups, the most exotic classes are probably the Suzuki groups and the Ree groups. They are "twisted versions" of groups of Lie type, but they cannot be directly obtained as groups of rational…

The subdivision graph $S(\Sigma)$ of a connected graph $\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\Sigma$ such that $S(\Sigma)$ is…

Suppose that an automorphism group $G$ acts flag-transitively on a finite generalized hexagon or octagon $\cS$, and suppose that the action on both the point and line set is primitive. We show that $G$ is an almost simple group of Lie type,…

A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…

For a graph $G$ and a positive integer $k$, a vertex labelling $f:V(G)\to\{1,2\ldots,k\}$ is said to be $k$-distinguishing if no non-trivial automorphism of $G$ preserves the sets $f^{-1}(i)$ for each $i\in\{1,\ldots,k\}$. The…

Let $S$ be a set of $n$ points in the plane in general position. Two line segments connecting pairs of points of $S$ cross if they have an interior point in common. Two vertex disjoint geometric graphs with vertices in $S$ cross if there…

Let $\mathcal{D} = (\mathcal{P}, \mathcal{B})$ be a $2$-$(v, k, \lambda)$ design, and let $G$ be a half-flag-transitive automorphism group of ${\cal D}$. In this article, we first establish three sufficient conditions for $G$ to be…

Let $S$ be a set of transpositions that generates the symmetric group $S_n$, where $n \ge 3$. The transposition graph $T(S)$ is defined to be the graph with vertex set $\{1,\ldots,n\}$ and with vertices $i$ and $j$ being adjacent in $T(S)$…

Let $G$ be a transitive permutation group on $\Omega$ with two points $\alpha, \beta\in\Omega$ such that $G_{\alpha}\cap G_{\beta}=1$. The Saxl graph $\Sigma(G)$ of the pair $(G,\Omega)$ is the graph with vertex set $\Omega$, while two…

We determine all finite primitive groups that are automorphism groups of edge-transitive hypergraphs. This gives an answer to a problem proposed by Babai and Cameron

We introduce two families of two-generator one-relator groups called primitive extension groups and show that a one-relator group is hyperbolic if its primitive extension subgroups are hyperbolic. This reduces the problem of characterising…

This paper determined all pairs $(\mathcal{D},G)$ where $\mathcal{D}$ is a non-symmetric 2-$(v,k,\lambda)$ design with $(r,\lambda)=1$ and $G$ is the almost simple flag-transitive automorphism group of $\mathcal{D}$ with an exceptional…

A group $G$ of permutations of a set $\Omega$ is {\em primitive} if it acts transitively on $\Omega$, and the only $G$-invariant equivalence relations on $\Omega$ are the trivial and universal relations. A graph $\Gamma$ is {\em primitive}…

We introduce the concept of the primitivity of independent set in vertex-transitive graphs, and investigate the relationship between the primitivity and the structure of maximum independent sets in direct products of vertex-transitive…

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

Suppose that a group $G$ has socle $L$ a simple large-rank classical group. Suppose furthermore that $G$ acts transitively on the set of lines of a linear space $\mathcal{S}$. We prove that, provided $L$ has dimension at least 25, then $G$…

A vertex in a graph is simplicial if its neighborhood forms a clique. We consider three generalizations of the concept of simplicial vertices: avoidable vertices (also known as \textit{OCF}-vertices), simplicial paths, and their common…

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…