English
Related papers

Related papers: Almost all standard double covers of abelian Cayle…

200 papers

Let $A$ be an abelian group and let $\iota$ be the automorphism of $A$ defined by $i:a\mapsto a^{-1}$. A Cayley graph $\Gamma=\mathrm{Cay}(A,S)$ is said to have an automorphism group \emph{as small as possible} if $\mathrm{Aut}(\Gamma)=…

Combinatorics · Mathematics 2014-05-09 Edward Dobson , Pablo Spiga , Gabriel Verret

Let $X$ be a connected Cayley graph on an abelian group of odd order, such that no two distinct vertices of $X$ have exactly the same neighbours. We show that the direct product $X \times K_2$ (also called the "canonical double cover" of…

Combinatorics · Mathematics 2020-10-13 Dave Witte Morris

A graph $\Gamma$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $\Gamma$ is normal if $G$ is a normal subgroup of ${\rm Aut}(\Gamma)$. We…

Combinatorics · Mathematics 2020-04-22 Majid Arezoomand , Mohsen Ghasemi

We show that for certain integers $n$, the problem of whether or not a Cayley digraph $\Gamma$ of $\mathbb Z_n$ is also isomorphic to a Cayley digraph of some other abelian group $G$ of order $n$ reduces to the question of whether or not a…

Combinatorics · Mathematics 2020-09-21 Edward Dobson , Joy Morris

A pair of graphs $(\Gamma,\Sigma)$ is called unstable if their direct product $\Gamma\times\Sigma$ admits automorphisms not from $\mathrm{Aut}(\Gamma)\times\mathrm{Aut}(\Sigma)$, and such automorphisms are said to be unexpected. The…

Combinatorics · Mathematics 2026-05-25 Xiaomeng Wang , Yan-Li Qin , Binzhou Xia

A graph $\Gamma$ is said to be unstable if for the direct product $\Gamma \times K_2$, $Aut(\Gamma \times K_2)$ is not isomorphic to $Aut(\Gamma) \times \mathbb{Z}_2$. In this paper we show that a connected and non-bipartite Cayley graph…

Combinatorics · Mathematics 2025-07-09 Ademir Hujdurović , István Kovács

Let $\Gamma=\mathrm{Cay}(G,S)$ be a Cayley digraph on a group $G$ and let $A=\mathrm{Aut}(\Gamma)$. The Cayley index of $\Gamma$ is $|A:G|$. It has previously been shown that, if $p$ is a prime, $G$ is a cyclic $p$-group and $A$ contains a…

Combinatorics · Mathematics 2017-03-08 Luke Morgan , Joy Morris , Gabriel Verret

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

In this paper we are interested in the asymptotic enumeration of bipartite Cayley digraphs and Cayley graphs over abelian groups. Let $A$ be an abelian group and let $\iota$ be the automorphism of $A$ defined by $a^\iota=a^{-1}$, for every…

Combinatorics · Mathematics 2020-01-16 Jia-Li Du , Yan-Quan Feng , Pablo Spiga

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

A pair of graphs $(\Gamma,\Sigma)$ is said to be stable if the full automorphism group of $\Gamma\times\Sigma$ is isomorphic to the product of the full automorphism groups of $\Gamma$ and $\Sigma$ and unstable otherwise, where…

Combinatorics · Mathematics 2022-10-14 Yan-Li Qin , Binzhou Xia , Sanming Zhou

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

Combinatorics · Mathematics 2012-03-06 Soumya Bhoumik , Edward Dobson , Joy Morris

Let $G$ be a regular graph of degree $d$ and let $A\subset V(G)$. Say that $A$ is $\eta$-closed if the average degree of the subgraph induced by $A$ is at least $\eta d$. This says that if we choose a random vertex $x\in A$ and a random…

Combinatorics · Mathematics 2018-10-01 W. T. Gowers , O. Janzer

The canonical double cover $\D(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\Aut(\D(\Gamma))\cong\Aut(\Gamma)\times\ZZ_2$ then $\Gamma$ is called stable; otherwise $\Gamma$ is called unstable. An unstable…

Combinatorics · Mathematics 2020-10-29 Yan-Li Qin , Binzhou Xia , Sanming Zhou

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

Combinatorics · Mathematics 2019-08-14 Yan-Quan Feng , István Kovács , Jie Wang , Da-Wei Yang

A Cayley digraph $\Gamma$ over a finite group $G$ is said to be CI if for every Cayley digraph $\Gamma^\prime$ over $G$ isomorphic to $\Gamma$, there is an isomorphism from $\Gamma$ to $\Gamma^\prime$ which is at the same time an…

Combinatorics · Mathematics 2025-03-04 Grigory Ryabov

We start up the study of the stability of general graph pairs. This notion is a generalization of the concept of the stability of graphs. We say that a pair of graphs $(\Gamma,\Sigma)$ is stable if $Aut(\Gamma\times\Sigma) \cong…

Combinatorics · Mathematics 2020-11-02 Yan-Li Qin , Binzhou Xia , Jin-Xin Zhou , Sanming Zhou

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

It was proved in [Y.-Q. Feng, C. H. Li and J.-X. Zhou, Symmetric cubic graphs with solvable automorphism groups, {\em European J. Combin.} {\bf 45} (2015), 1-11] that a cubic symmetric graph with a solvable automorphism group is either a…

Combinatorics · Mathematics 2016-07-12 Yan-Quan Feng , Klavdija Kutnar , Dragan Marusic , Da-Wei Yang

The canonical double cover $\mathrm{D}(\Gamma)$ of a graph $\Gamma$ is the direct product of $\Gamma$ and $K_2$. If $\mathrm{Aut}(\mathrm{D}(\Gamma))=\mathrm{Aut}(\Gamma)\times\mathbb{Z}_2$ then $\Gamma$ is called stable; otherwise $\Gamma$…

Combinatorics · Mathematics 2018-10-18 Yan-Li Qin , Binzhou Xia , Sanming Zhou
‹ Prev 1 2 3 10 Next ›