English
Related papers

Related papers: Using mixed dihedral groups to construct normal Ca…

200 papers

In \cite{Chan95}, the authors classified the 2-extendable abelian Cayley graphs and posed the problem of characterizing all 2-extendable Cayley graphs. We first show that a connected bipartite Cayley (vertex-transitive) graph is…

Combinatorics · Mathematics 2016-12-12 Qiuli Li , Xing Gao

A Cayley Graph for a group $G$ is called normal edge-transitive if it admits an edge-transitive action of some subgroup of the Holomorph of $G$ (the normaliser of a regular copy of $G$ in $\operatorname{Sym}(G)$). We complete the…

Combinatorics · Mathematics 2014-01-10 Brian P. Corr , Cheryl E. Praeger

Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavi\v{c} and Poto\v{c}nik proposed the problem of charaterizing distance-regular Cayley graphs, which can be viewed as a natural…

Combinatorics · Mathematics 2023-11-15 Xueyi Huang , Lu Lu , Xiongfeng Zhan

The power graph of a group $G$ is a graph with vertex set $G$, in which two vertices are adjacent if one is some power of the other. In the commuting graph, with $G$ as the vertex set, two vertices are joined by an edge if they commute in…

Group Theory · Mathematics 2024-06-04 Surbhi , Geetha Venkataraman

The hyper-star graph $HS(n,k)$ is defined as follows : its vertex-set is the set of $ {0,1} $-sequences of length $n$ with weight $k$, where the weight of a sequence $v$ is the number of $1^,s$ in $v$, and two vertices are adjacent if and…

Group Theory · Mathematics 2011-03-21 S. Morteza Mirafzal

This paper investigates the enumeration of Cayley digraphs, focusing on counting Cayley digraphs on dihedral groups up to CI-isomorphism. By leveraging the Cauchy-Frobenius Lemma and properties of automorphisms, we derive an explicit…

Combinatorics · Mathematics 2025-07-30 Zai Ping Lu , Jia Yin Xie , Jin-Hua Xie

In this paper, we study arc-transitive Cayley graphs on non-abelian simple groups with soluble stabilizers and valency seven. Let $\Ga$ be such a Cayley graph on a non-abelian simple group $T$. It is proved that either $\Ga$ is a normal…

Combinatorics · Mathematics 2017-08-01 Jiangmin Pan , Fugang Yin , Bo Ling

A semiregular permutation group on a set $\Ome$ is called {\em bi-regular} if it has two orbits. A classification is given of quasiprimitive permutation groups with a biregular dihedral subgroup. This is then used to characterize the family…

Group Theory · Mathematics 2023-08-31 Jiangmin Pan , Fu-Gang Yin , Jin-Xin Zhou

A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…

Combinatorics · Mathematics 2019-11-13 Heather A. Newman , Hector Miranda , Darren A. Narayan

A Cayley digraph on a group $G$ is called NNN if the Cayley digraph is normal and its automorphism group contains a non-normal regular subgroup isomorphic to $G$. A group is called NNND-group or NNN-group if there is an NNN Cayley digraph…

Group Theory · Mathematics 2025-03-17 Jun-Feng Yang , Yan-Quan Feng , Fu-Gang Yin , Jin-Xin Zhou

We classify all finite 2-groups that have a cyclic or dihedral maximal subgroup and determine their automorphism groups. Based on this result, we classify all pairs $ (G,\mathcal{M}) $, such that $ G $ is a finite 2-group and $ \mathcal{M}…

Group Theory · Mathematics 2025-08-11 Peice Hua

\noindent The augmented cube graph $AQ_n$ is the Cayley graph of $\mathbb{Z}_2^n$ with respect to the set of $2n-1$ generators $\{e_1,e_2, \ldots,e_n, 00\ldots0011, 00\ldots0111, 11\ldots1111 \}$. It is known that the order of the…

Combinatorics · Mathematics 2015-08-31 Ashwin Ganesan

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

The standard double cover of a graph $\Gamma$ is the direct product $\Gamma\times K_2$. A graph $\Gamma$ is said to be stable if all the automorphisms of $\Gamma\times K_2$ come from its factors. Although the study of stability has…

Combinatorics · Mathematics 2026-01-29 Binzhou Xia , Zhishuo Zhang , Shasha Zheng

Following Alspach and Parsons, a {\em metacirculant graph} is a graph admitting a transitive group generated by two automorphisms $\rho$ and $\sigma$, where $\rho$ is $(m,n)$-semiregular for some integers $m \geq 1$, $n \geq 2$, and where…

Combinatorics · Mathematics 2007-05-23 Dragan Marusic , Primoz Sparl

Let $G$ be a (finite or infinite) group, and let $K_G = \mathrm{Cay} ( G;G \smallsetminus \{1\} )$ be the complete graph with vertex set $G$, considered as a Cayley graph of $G$. Being a Cayley graph, it has a natural edge-colouring by sets…

Combinatorics · Mathematics 2024-04-16 Shirin Alimirzaei , Dave Witte Morris

The mirror (or bipartite complement) mir(B) of a bipartite graph B=(X,Y,E) has the same color classes X and Y as B, and two vertices x in X and y in Y are adjacent in mir(B) if and only if xy is not in E. A bipartite graph is chordal…

Discrete Mathematics · Computer Science 2013-09-24 Anne Berry , Andreas Brandstädt , Konrad Engel

A graph $G$ covers a graph $H$ if there exists a locally bijective homomorphism from $G$ to $H$. We deal with regular covers in which this locally bijective homomorphism is prescribed by an action of a subgroup of ${\rm Aut}(G)$. Regular…

Combinatorics · Mathematics 2014-05-29 Jiří Fiala , Pavel Klavík , Jan Kratochvíl , Roman Nedela

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

Combinatorics · Mathematics 2024-03-29 C. Dalfó , G. Erskine , G. Exoo , M. A. Fiol , J. Tuite

Let $G$ be a finite group. For each $m>1$ we define the symmetric canonical subset $S=S(m)$ of the Cartesian power $G^m$ and we consider the family of Cayley graphs $\mathscr{G}_m(G)=Cay(G^m,S)$. We describe properties of these graphs and…

Combinatorics · Mathematics 2019-11-14 Czesław Bagiński , Piotr Grzeszczuk
‹ Prev 1 3 4 5 6 7 10 Next ›