English
Related papers

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

200 papers

A graph Gamma is said to be 2-arc-transitive if its full automorphism group Aut(\Gamma) has a single orbit on ordered paths of length 2, and for G\leq Aut(\Gamma), \Gamma is G-regular if G is regular on the vertex set of \Gamma. Let G be a…

Group Theory · Mathematics 2017-01-06 Jia-Li Du , Yan-Quan Feng

In this paper we consider connected locally $G$-arc-transitive graphs with vertices of valence 3 and 4, such that the kernel $G_{uv}^{[1]}$ of the action of an edge-stabiliser on the neighourhood $\Gamma(u) \cup \Gamma(v)$ is trivial. We…

Combinatorics · Mathematics 2012-10-16 Primož Potočnik

In the paper we give an exhaustive arithmetic criterion of adjacency in prime graph $GK(G)$ for every finite nonabelian simple group $G$. By using this criterion for all finite simple groups an independence set with the maximal number of…

Group Theory · Mathematics 2018-10-30 Anrei V. Vasilév , Evgeny P. Vdovin

In this paper, we give a necessary and sufficient condition for the integrality of Cayley graphs over the dihedral group $D_n=\langle a,b\mid a^n=b^2=1,bab=a^{-1}\rangle$. Moreover, we also obtain some simple sufficient conditions for the…

Combinatorics · Mathematics 2016-06-08 Lu Lu , Qiongxiang Huang , Xueyi Huang

A number of authors have studied the question of when a graph can be represented as a Cayley graph on more than one nonisomorphic group. The work to date has focussed on a few special situations: when the groups are $p$-groups; when the…

Combinatorics · Mathematics 2020-05-26 Joy Morris , Josip Smolcic

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

Combinatorics · Mathematics 2016-12-06 Sébastien Martineau

A Cayley graph of a group $H$ is a finite simple graph $\Gamma$ such that ${\rm Aut}(\Gamma)$ contains a subgroup isomorphic to $H$ acting regularly on $V(\Gamma)$, while a Haar graph of $H$ is a finite simple bipartite graph $\Sigma$ such…

Combinatorics · Mathematics 2017-07-12 Yan-Quan Feng , Istvan Kovacs , Da-Wei Yang

An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…

Combinatorics · Mathematics 2021-08-02 Fu-Gang Yin , Yan-Quan Feng , Jin-Xin Zhou , A-Hui Jia

The problem of constructing or characterizing strongly regular Cayley graphs (or equivalently, regular partial difference sets) has garnered significant attention over the past half-century. In 2003, Miklavi\v{c} and Poto\v{c}nik [European…

Combinatorics · Mathematics 2025-02-14 Xiongfeng Zhan , Xueyi Huang , Lu Lu

Let $X$ be a finite vertex-transitive graph of valency $d$, and let $A$ be the full automorphism group of $X$. Then the arc-type of $X$ is defined in terms of the sizes of the orbits of the action of the stabiliser $A_v$ of a given vertex…

Combinatorics · Mathematics 2015-05-11 Marston Conder , Tomaž Pisanski , Arjana Žitnik

Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of them. A graph is called a weak metacirculant if it has a vertex-transitive metacyclic automorphism group. This…

Combinatorics · Mathematics 2017-11-21 Jin-Xin Zhou , Sanming Zhou

The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…

Group Theory · Mathematics 2024-06-14 Melissa Lee , Tomasz Popiel

We explicitly determine all of the transitive groups of degree p-squared, p a prime, whose Sylow p-subgroup is not the wreath product of two cyclic groups of order p. Furthermore, we provide a general description of the transitive groups of…

Group Theory · Mathematics 2009-03-03 Edward Dobson , Dave Witte

We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…

Combinatorics · Mathematics 2019-12-03 Simon Schmidt , Chase Vogeli , Moritz Weber

A graph $\Gamma$ is a bi-Cayley graph over a group $G$ if $G$ is a semiregular group of automorphisms of $\Gamma$ having two orbits. Let $G$ be a non-abelian metacyclic $p$-group for an odd prime $p$, and let $\Gamma$ be a connected…

Combinatorics · Mathematics 2017-07-11 Yi Wang , Yan-Quan Feng

A connected graph whose automorphism group acts transitively on the edges and vertices, but not on the set of ordered pairs of adjacent vertices of the graph is called half-arc-transitive. It is well known that the valence of a…

Combinatorics · Mathematics 2015-03-16 Primož Potočnik , Rok Požar

In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…

Group Theory · Mathematics 2022-01-04 Chris Florez , Jonathan Higgins , Kyle Huang , Thomas Michael Keller , Dawei Shen , Yong Yang

In this paper, generalized Cayley graphs are studied. It is proved that every generalized Cayley graph of order 2p is a Cayley graph, where p is a prime. Special attention is given to generalized Cayley graphs on Abelian groups. It is…

Combinatorics · Mathematics 2015-12-02 Ademir Hujdurović , Klavdija Kutnar , Pawel Petecki , Anastasiya Tanana

Relying on the Classification of Finite Simple Groups it was shown by Feng and Xu (Discrete Math., 2005) that every quartic Cayley graph of a regular $p$-group, $p \neq 2,5$, is normal. In this paper a CFSG-free proof of Feng-Xu theorem is…

Combinatorics · Mathematics 2026-04-20 Klavdija Kutnar , Aleksander Malnič , Dragan Marušič

We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex…

Combinatorics · Mathematics 2020-07-14 Agelos Georgakopoulos , Matthias Hamann , Alex Wendland