English
Related papers

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

200 papers

A mixed graph is called \emph{second kind hermitian integral}(or \emph{HS-integral}) if the eigenvalues of its Hermitian-adjacency matrix of second kind are integers. A mixed graph is called \emph{Eisenstein integral} if the eigenvalues of…

Combinatorics · Mathematics 2022-04-20 Monu Kadyan , Bikash Bhattacharjya

Let $p$ be an odd prime, and $D_{2p}=\langle a,b\mid a^p=b^2=1,bab=a^{-1}\rangle$ the dihedral group of order $2p$. In this paper, we completely classify the cubic Cayley graphs on $D_{2p}$ up to isomorphism by means of spectral method. By…

Combinatorics · Mathematics 2017-08-29 Xueyi Huang , Qiongxiang Huang , Lu Lu

In the past few decades, quantum algorithms have become a popular research area of both mathematicians and engineers. Among them, uniform mixing provides a uniform probability distribution of quantum information over time which attracts a…

Combinatorics · Mathematics 2025-09-03 Xiwang Cao

We study a class of finite groups $G$ which behave similarly to elementary abelian $p$-groups with $p$ prime, that is, there exists a subgroup $N$ such that all elements of $G\setminus N$ are conjugate or inverse-conjugate under $\Aut(G)$.…

Group Theory · Mathematics 2018-01-30 Lei Wang , Yin Liu

We construct an infinite family of connected, 2-generated Cayley digraphs Cay(G;a,b) that do not have hamiltonian paths, such that the orders of the generators a and b are arbitrarily large. We also prove that if G is any finite group with…

Combinatorics · Mathematics 2013-06-25 Dave Witte Morris

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

We determine two new infinite families of Cayley graphs that admit colour-preserving automorphisms that do not come from the group action. By definition, this means that these Cayley graphs fail to have the CCA (Cayley Colour Automorphism)…

Combinatorics · Mathematics 2020-05-26 Brandon Fuller , Joy Morris

We construct pairs of marked groups with isomorphic Cayley graphs but different Borel chromatic numbers for the free parts of their shift graphs. This answers a question of Kechris and Marks. We also show that these graphs have different…

Logic · Mathematics 2019-06-03 Felix Weilacher

In a recent paper (arXiv:1505.01475 ) Est\'elyi and Pisanski raised a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct an infinite family of trivalent Haar graphs that are…

Group Theory · Mathematics 2016-03-21 Marston Conder , István Estélyi , Tomaž Pisanski

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

Group Theory · Mathematics 2019-08-07 Anthony Genevois , Alexandre Martin

We extend the notion of an $H$-normal quotient digraph of an $H$-vertex-transitive digraph to that of an $H$-subnormal quotient digraph. Using these concepts, together with bipartite halves of bipartite digraphs, we show that, for each…

Combinatorics · Mathematics 2025-12-22 Lei Chen , Cheryl Praeger

In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavi\v{c} and Poto\v{c}nik proposed the problem of characterizing distance-regular Cayley graphs, which can be viewed as an extension of…

Combinatorics · Mathematics 2023-08-29 Xiongfeng Zhan , Lu Lu , Xueyi Huang

A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…

Combinatorics · Mathematics 2007-07-03 Joy Morris , Pablo Spiga , Kerri Webb

We introduce the concept of alternate-edge-colourings for maps, and study highly symmetric examples of such maps. Edge-biregular maps of type $(k,l)$ occur as smooth normal quotients of a particular index two subgroup of $T_{k,l}$, the full…

Combinatorics · Mathematics 2020-10-30 Olivia Reade Jeans

The isomorphism problem for digraphs is a fundamental problem in graph theory. In this paper, we consider this problem for $m$-Cayley digraphs which are generalization of Cayley digraphs. Let $m$ be a positive integer. A digraph admitting a…

Combinatorics · Mathematics 2025-06-17 Xing Zhang , Yan-Quan Feng , Jin-Xin Zhou , Fu-Gang Yin

Let $G$ be a finite, undirected $d$-regular graph and $A(G)$ its normalized adjacency matrix, with eigenvalues $1 = \lambda_1(A)\geq \dots \ge \lambda_n \ge -1$. It is a classical fact that $\lambda_n = -1$ if and only if $G$ is bipartite.…

Combinatorics · Mathematics 2021-11-02 Nina Moorman , Peter Ralli , Prasad Tetali

A graph $\Gamma$ is said to be symmetric if its automorphism group $\rm Aut(\Gamma)$ acts transitively on the arc set of $\Gamma$. In this paper, we show that if $\Gamma$ is a finite connected heptavalent symmetric graph with solvable…

Combinatorics · Mathematics 2017-10-04 Jia-Li Du , Yan-Quan Feng , Yu-Qin Liu

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

{\em Honeycomb toroidal graphs} are a family of cubic graphs determined by a set of three parameters, that have been studied over the last three decades both by mathematicians and computer scientists. They can all be embedded on a torus and…

Combinatorics · Mathematics 2024-12-09 Primoz Sparl

We characterise connected cubic graphs admitting a vertex- transitive group of automorphisms with an abelian normal subgroup that is not semiregular. We illustrate the utility of this result by using it to prove that the order of a…

Combinatorics · Mathematics 2014-01-14 Joy Morris , Pablo Spiga , Gabriel Verret