English
Related papers

Related papers: On covers of graphs by Cayley graphs

200 papers

We construct connected $2$-arc-transitive covers of complete graphs with non-abelian characteristically simple transformation groups. This solves the existence problem for non-solvable $2$-arc-transitive covers of complete graphs.

Combinatorics · Mathematics 2026-04-03 Jiyong Chen , Cai Heng Li , Ci Xuan Wu , Yan Zhou Zhu

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

Group Theory · Mathematics 2022-08-25 Sam Shepherd , Giles Gardam , Daniel J. Woodhouse

We study the existence of periodic colorings and orientations in locally finite graphs. A coloring or orientation of a graph $G$ is periodic if the resulting colored or oriented graph is quasi-transitive, meaning that $V(G)$ has finitely…

Cayley graphs are graphs on algebraic structures, typically groups or group-like structures. In this paper, we have obtained a few results on Cayley graphs on Cyclic groups, powers of cycles, Cayley graphs on some non-abelian groups, and…

Combinatorics · Mathematics 2023-08-23 Prajnanaswaroopa S

An arc of a graph is an oriented edge and a 3-arc is a 4-tuple $(v,u,x,y)$ of vertices such that both $(v,u,x)$ and $(u,x,y)$ are paths of length two. The 3-arc graph of a graph $G$ is defined to have vertices the arcs of $G$ such that two…

Combinatorics · Mathematics 2013-11-14 Guangjun Xu , Sanming Zhou

Two finitely generated monoids are constructed, one finitely presented the other not, whose (directed, unlabelled) Cayley graphs are isomorphic.

Group Theory · Mathematics 2016-10-18 J. Awang , M. Pfeiffer , N. Ruskuc

We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.

Combinatorics · Mathematics 2009-10-30 Matthias Hamann , Julian Pott

Leighton's graph covering theorem states that two finite graphs with common universal cover have a common finite cover. We generalize this to a large family of non-positively curved special cube complexes that form a natural generalization…

Group Theory · Mathematics 2023-10-04 Daniel J. Woodhouse

We show that the star graph defined as the Cayley graph of ${\mathfrak S}_{n+1}$ generated by the star transpositions is an ${\mathfrak S}_n$-cover of the complete graph $K_{n+1}$, which is known to have fine spectral properties. In the…

Combinatorics · Mathematics 2026-02-06 Taizo Sadahiro

A Cayley graph $\Cay(G,S)$ is said to be inner-automorphic if $S$ is a union of conjugacy classes of a group $G$, and arc-transitive if its full automorphism group acts transitively on the set of arcs. In this paper, we characterize four…

Group Theory · Mathematics 2026-04-07 Jun-Jie Huang , Jin-Hua Xie

A map on a surface whose automorphism group has a subgroup acting regularly on its vertices is called a Cayley map. Here we generalize that notion to maniplexes and polytopes. We define $\mathcal{M}$ to be a \emph{Cayley extension} of…

Combinatorics · Mathematics 2023-05-22 Gabe Cunningham , Elías Mochán , Antonio Montero

Given a finite simple graph $\Gamma$ on $n$ vertices its complementary prism is the graph $\Gamma\bar{\Gamma}$ that is obtained from $\Gamma$ and its complement $\bar{\Gamma}$ by adding a perfect matching, where each its edge connects two…

Combinatorics · Mathematics 2021-10-22 Marko Orel

The core of this note is the observation that links between circle packings of graphs and potential theory developed in \cite{BeSc01} and \cite{HS} can be extended to higher dimensions. In particular, it is shown that every limit of finite…

Probability · Mathematics 2010-10-14 Itai Benjamini , Nicolas Curien

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…

Group Theory · Mathematics 2021-04-01 Jing Jian Li , Zai Ping Lu

Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of consecutive edges in the ordering -- an angle -- such that each…

Computational Geometry · Computer Science 2022-09-23 William Evans , Ellen Gethner , Jack Spalding-Jamieson , Alexander Wolff

A graph $\G$ admitting a group $H$ of automorphisms acting semi-regularly on the vertices with exactly two orbits is called a {\em bi-Cayley graph\/} over $H$. Such a graph $\G$ is called {\em normal\/} if $H$ is normal in the full…

Combinatorics · Mathematics 2016-06-16 Marston Conder , Jin-Xin Zhou , Yan-Quan Feng , Mi-Mi Zhang

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

We prove that there exist functions $f$ and $g$ such that for all positive integers $k$ and $d$, for every graph $G$ and every subset $A$ of the vertices of $G$, either $G$ contains $k$ $A$-paths such that vertices of different $A$-paths…

Combinatorics · Mathematics 2026-01-27 Marc Distel , Ugo Giocanti , Jędrzej Hodor , Clément Legrand-Duchesne , Piotr Micek

We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…

Combinatorics · Mathematics 2019-01-04 Agelos Georgakopoulos , Matthias Hamann

We prove that every 1-planar graph G has a z-parallel visibility representation, i.e., a 3D visibility representation in which the vertices are isothetic disjoint rectangles parallel to the xy-plane, and the edges are unobstructed…

Computational Geometry · Computer Science 2017-08-22 Patrizio Angelini , Michael A. Bekos , Michael Kaufmann , Fabrizio Montecchiani
‹ Prev 1 4 5 6 7 8 10 Next ›