16,757 research outputs found
On 2-arc-transitive graphs of product action type
In this paper, we discuss the structural information about 2-arc-transitive
(non-bipartite and bipartite) graphs of product action type. It is proved that
a 2-arc-transitive graph of product action type requires certain restrictions
on either the vertex-stabilizers or the valency. Based on the existence of some
equidistant linear codes, a construction is given for 2-arc-transitive graphs
of non-diagonal product action type, which produces several families of such
graphs. Besides, a nontrivial construction is given for 2-arc-transitive
bipartite graphs of diagonal product action typeComment: 18 page
Intersection density of imprimitive groups of degree
A subset of a finite transitive group is \emph{intersecting} if any two elements of
agree on an element of . The \emph{intersection density}
of is the number \rho(G) = \max\left\{ \frac{\mathcal{|F|}}{|G|/|\Omega|}
\mid \mathcal{F}\subset G \mbox{ is intersecting} \right\}.
Recently, Hujdurovi\'{c} et al. [Finite Fields Appl., 78 (2022), 101975]
disproved a conjecture of Meagher et al. (Conjecture~6.6~(3) in [ J.~Combin.
Theory, Ser. A 180 (2021), 105390]) by constructing equidistant cyclic codes
which yield transitive groups of degree , where and
are odd primes, and whose intersection density equal to .
In this paper, we use the cyclic codes given by Hujdurovi\'{c} et al. and
their permutation automorphisms to construct a family of transitive groups
of degree with , whenever
are odd primes. Moreover, we extend their construction using cyclic codes of
higher dimension to obtain a new family of transitive groups of degree a
product of two odd primes , and whose intersection
density are equal to . Finally, we prove that if of degree a product of two arbitrary odd primes
and is a
proper subgroup, then
- β¦