English
Related papers

Related papers: Arc-transitive Cayley graphs on nonabelian simple …

200 papers

We continue the study of prime graphs of finite groups, also known as Gruenberg-Kegel graphs. The vertices of the prime graph of a finite group are the prime divisors of the group order, and two vertices $p$ and $q$ are connected by an edge…

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…

Combinatorics · Mathematics 2022-10-26 Ziyu Huang , Thomas Michael Keller , Shane Kissinger , Wen Plotnick , Maya Roma

This paper represents a significant leap forward in the problem of enumerating vertex-transitive graphs. Recent breakthroughs on symmetry of Cayley (di)graphs show that almost all finite Cayley (di)graphs have the smallest possible…

Combinatorics · Mathematics 2025-11-25 Yunsong Gan , Pablo Spiga , Binzhou Xia

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

Group Theory · Mathematics 2021-05-27 Arnbjörg Soffía Árnadóttir , Waltraud Lederle , Rögnvaldur G. Möller

Half-arc-transitive graphs are a fascinating topic which connects graph theory, Riemann surfaces and group theory. Although fruitful results have been obtained over the last half a century, it is still challenging to construct…

Combinatorics · Mathematics 2020-11-10 Binzhou Xia

We consider the class of the topologically locally finite (in short TLF) planar vertex-transitive graphs, a class containing in particular all the one-ended planar Cayley graphs and the normal transitive tilings. We characterize these…

Discrete Mathematics · Computer Science 2007-05-23 D. Renault

We explore graph theoretical properties of minimal prime graphs of finite solvable groups. In finite group theory studying the prime graph of a group has been an important topic for the past almost half century. Recently prime graphs of…

Combinatorics · Mathematics 2020-11-23 Chris Florez , Jonathan Higgins , Kyle Huang , Thomas Michael Keller , Dawei Shen

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…

Combinatorics · Mathematics 2021-06-22 Michael Giudici , Carlisle S. H. King

Given a finite group $G$, its prime graph $\Gamma(G)$ (also known as its Gruenberg-Kegel graph) is the graph whose vertices are the prime divisors of $|G|$ and where edges $\{p, q\}$ exist whenever $G$ contains an element of order $pq$. We…

Group Theory · Mathematics 2025-11-21 Lucas Alland , Andrei Fridman , Thomas Michael Keller

Let $p$ and $q$ be distinct odd primes. Let $\Gamma=(V(\Gamma), E(\Gamma))$ be a non-Cayley vertex-transitive graph of order $pq.$ Let $G\leq \Aut(\Gamma)$ acts primitively on the vertex set $V(\Gamma)$. In this paper, we show that $G$ is…

Group Theory · Mathematics 2014-07-18 Mohammad A. Iranmanesh

A graph is called {\em half-arc-transitive} if its full automorphism group acts transitively on vertices and edges, but not on arcs. It is well known that for any prime $p$ there is no tetravalent half-arc-transitive graph of order $p$ or…

Combinatorics · Mathematics 2016-05-27 Yi Wang , Yan-Quan Feng

We prove that there is a unique graph with four edges which is the Gruenberg-Kegel graph of a solvable cut group. This contributes to the classification of the Gruenberg-Kegel graphs of solvable cut groups initiated in [A. B\"achle, A.…

Group Theory · Mathematics 2026-04-03 Sara C. Debón , Diego García-Lucas , Ángel del Río

A nut graph is a non-trivial simple graph such that its adjacency matrix has a one-dimensional null space spanned by a full vector. It was recently shown by the authors that there exists a $d$-regular circulant nut graph of order $n$ if and…

Combinatorics · Mathematics 2023-05-31 Ivan Damnjanović

A \emph{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 we give a sufficient condition…

Combinatorics · Mathematics 2023-04-24 Daniel R. Hawtin , Cheryl E. Praeger , Jin-Xin Zhou

In this paper, we examine the structure of vertex- and edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using…

Combinatorics · Mathematics 2009-07-10 Joy Morris , Cheryl E. Praeger , Pablo Spiga

The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel…

Combinatorics · Mathematics 2016-03-29 Jing Chen , Binzhou Xia

Resolving parameters is a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences. In this article, we construct a class of Toeplitz graphs, and will be denoted by…

Combinatorics · Mathematics 2021-12-14 Jia-Bao Liu , Ali Zafari

Li and Praeger classified finite nonabelian simple groups, it has only one or two fusion classes of any certain value. As a by-product, they classified m-CI-groups, which is critical in the research of Cayley graphs. In the paper, we will…

Combinatorics · Mathematics 2019-10-16 Xiao-Min Zhu , Xu Yang

A graph $\Gamma$ is basic if Aut$\Gamma$ has no normal subgroup $N\ne1$ such that $\Gamma$ is a normal cover of the normal quotient graph $\Gamma_N$. In this paper, we completely determine the basic normal quotient graphs of all connected…

Combinatorics · Mathematics 2019-06-25 Jiangmin Pan , Junjie Huang , Chao Wang

We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…

Functional Analysis · Mathematics 2014-12-03 Matthias Keller , Daniel Lenz , Marcel Schmidt , Radosław K. Wojciechowski