Searcharxiv⌕ Search

arXiv subjects

Jing Jian Li

Publications and source records attributed to Jing Jian Li.

8 recordsLinked to original sources

Prime-valent Symmetric Cayley Graphs of Characteristically Simple Groups

Let $\Ga$ be a connected prime-valent $X$-arc-transitive Cayley graph of a finite characteristically simple group $G\cong T^k$, where $k\geqslant2$. We obtain a precise structural characterization of such graphs and their arc-transitive automorphism groups. In the cubic case, every connected symmetric Cayley graph of $T^k$, where $T$ is a finite nonabelian simple group, is normal.

math.CO↗

On Arc-Transitive Regular Covers of Cubic Edge-Primitive Graphs

We determine, up to isomorphism of the covering graphs, the connected arc-transitive regular covers of cubic edge-primitive graphs whose covering transformation group is cyclic or elementary abelian of order $p^2$, where $p$ is a prime. Combining the known classifications for the base graphs ${\rm K_{3,3}}$ and ${\rm DC_{14}}$ with new arguments for ${\rm F30A}$ and ${\rm F102A}$ gives the full list in these two classes of covering groups. In the cyclic case, the covers of ${\rm F30A}$ and ${\rm F102A}$ are ${\rm F90A}$ and ${\rm F204A}$, respectively. In the elementary abelian case, neither ${\rm F30A}$ nor ${\rm F102A}$ admits an arc-transitive regular $\mathbb{Z}_p^2$-cover, so the base graph is ${\rm K_{3,3}}$ or ${\rm DC_{14}}$.

math.CO↗

Vertex-primitive $s$-arc-transitive Cayley digraphs

Determining an upper bound on $s$ for vertex-primitive $s$-arc-transitive digraphs has been an open problem of considerable interest since a question asked by Praeger in 1990. Although much progress has been made and an upper bound is conjectured to be $2$, a complete classification for $s=2$ remains out of reach. In this paper, we prove that the tight upper bound on $s$ for finite vertex-primitive $s$-arc-transitive Cayley digraphs is exactly $2$. Furthermore, we completely characterize the structure of these digraphs when $s=2$.

math.CO↗

Bounding $s$ for vertex-primitive $s$-arc-transitive digraphs of alternating and symmetric groups

Determining an upper bound on $s$ for finite vertex-primitive $s$-arc-transitive digraphs has received considerable attention dating back to a question of Praeger in 1990. It was shown by Giudici and Xia that the smallest upper bound on $s$ is attained for some digraph admitting an almost simple $s$-arc-transitive group. In this paper, based on the work of Pan, Wu and Yin, we prove that $s\leqslant 2$ in the case where the group is an alternating or symmetric group.

math.CO↗

Cubic Graphical Regular Representations of $\mathrm{PSU}_3(q)$

A graphical regular representation (GRR) of a group $G$ is a Cayley graph of $G$ whose full automorphism group is equal to the right regular permutation representation of $G$. Towards a proof of the conjecture that only finitely many finite simple groups have no cubic GRR, this paper shows that $\mathrm{PSU}_3(q)$ has a cubic GRR if and only if $q\geq4$. Moreover, a cubic GRR of $\mathrm{PSU}_3(q)$ is constructed for each of these $q$.

math.GR↗

Two-arc-transitive graphs of odd order -- II

It is shown that each subgroup of odd index in an alternating group of degree at least 10 has all insoluble composition factors to be alternating. A classification is then given of 2-arc-transitive graphs of odd order admitting an alternating group or a symmetric group. This is the second of a series of papers aiming towards a classification of 2-arc-transitive graphs of odd order.

math.CO↗

Symmetric graphs of prime valency with a transitive simple group

A graph $\Ga=(V,E)$ is called a Cayley graph of some group $T$ if the automorphism group $\Aut(\Ga)$ contains a subgroup $T$ which acts on regularly on $V$. If the subgroup $T$ is normal in $\Aut(\Ga)$ then $\Ga$ is called a normal Cayley graph of $T$. Let $r$ be an odd prime. Fang et al. \cite{FMW} proved that, with a finite number of exceptions for finite simple group $T$, every connected symmetric Cayley graph of $T$ of valency $r$ is normal. In this paper, employing maximal factorizations of finite almost simple groups, we work out a possible list of those exceptions for $T$.

math.GR↗

On the automorphism groups of graphs with twice prime valency

A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $Γ$ be a connected graph of odd order and twice prime valency, and let $G$ be a subgroup of the automorphism group of $\Ga$. In the case where $G$ acts transitively on the edges and quasiprimitively on the vertices of $\Ga$, we prove that either $G$ is almost simple or $G$ is a primitive group of affine type. If further $G$ is an almost simple primitive group then, with two exceptions, the socle of $G$ acts transitively on the edges of $Γ$.

math.CO↗