Related papers: Vertex-primitive $s$-arc-transitive digraphs of li…
A central problem in the study of generalized quadrangles is to classify finite generalized quadrangles satisfying certain symmetry conditions. It is known that an automorphism group of a finite thick generalized quadrangle $\mathcal{S}$…
Let $\mathcal{S}$ be a finite thick generalized quadrangle, and suppose that $G$ is an automorphism group of $\mathcal{S}$. If $G$ acts primitively on both the points and lines of $\mathcal{S}$, then it is known that $G$ must be almost…
We compute the elementary divisors of the adjacency and Laplacian matrices of families of polar graphs. These graphs have as vertices the isotropic one-dimensional subspaces of finite vector spaces with respect to non-degenerate forms, with…
Let $\mathscr{L}_{n,t}$ be the set of all $n$-vertex connected graphs with clique number $t$\,($2\leq t\leq n)$. For $n$-vertex connected graphs with given clique number, lexicographic ordering by spectral moments ($S$-order) is discussed…
In this short article, we consider a problem about $2$-partition of the vertices of a graph. If a graph admits such a partition into some 'small' graphs, then the number of edges cross an arbitrary cut of the graph $e(S,S^{c})$ has a nice…
The purpose of this paper is to classify all pairs $(\mathcal{D}, G)$, where $\mathcal{D}$ is a non-trivial $2$-$(v, k, 2)$ design, and $G\leq Aut(\mathcal{D})$ acts transitively on the set of blocks of $\mathcal{D}$ and primitively on the…
A permutation group is called semiprimitive if each of its normal subgroups is either transitive or semiregular. Given nontrivial finite transitive permutation groups $L_1$ and $L_2$ with $L_1$ not semiprimitive, we construct an infinite…
This paper studies the free group of rank two from the point of view of Stallings core graphs. The first half of the paper examines primitive elements in this group, giving new and self-contained proofs for various known results about them.…
Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…
The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…
Let $n$ be a positive integer, $q$ be a prime power, and $V$ be a vector space of dimension $n$ over $\mathbb{F}_q$. Let $G := V \rtimes G_0$, where $G_0$ is an irreducible subgroup of ${\rm GL}(V)$ which is maximal by inclusion with…
The \emph{intersection density} of a transitive permutation group $G\leq \operatorname{Sym}(\Omega)$ is the ratio between the largest size of a subset of $G$ in which any two agree on at least one element of $\Omega$, and the order of a…
In this paper, a complete classification of finite simple cubic vertex-transitive graphs of girth $6$ is obtained. It is proved that every such graph, with the exception of the Desargues graph on $20$ vertices, is either a skeleton of a…
We study upper bounds on the size of optimum locating-total dominating sets in graphs. A set $S$ of vertices of a graph $G$ is a locating-total dominating set if every vertex of $G$ has a neighbor in $S$, and if any two vertices outside $S$…
In this paper we complete a classification of finite linear spaces $\cS$ with line size at most 12 admitting a line-transitive point-imprimitive subgroup of automorphisms. The examples are the Desarguesian projective planes of orders $4,7,…
A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…
A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a…
A general method for constructing sharply $k$-arc-transitive digraphs, i.e. digraphs that are $k$-arc-transitive but not $(k+1)$-arc-transitive, is presented. Using our method it is possible to construct both finite and infinite examples.…
Let $G$ be a finite group and $\text{cd}(G)$ denote the character degree set for $G$. The prime graph $\Delta(G)$ is a simple graph whose vertex set consists of prime divisors of elements in $\text{cd}(G)$, denoted $\rho(G)$. Two primes…
A transitive smooth action of a connected Lie group G on a manifold M is called almost primitive (resp. primitive) if G doesn't contain any proper subgroup (resp. any proper normal subgroup) whose induced action on M is transitive as well.…