English
Related papers

Related papers: On distance-regular Cayley graphs on abelian group…

200 papers

Let $G$ be a generalized dicyclic group with identity $1$. An inverse closed subset $S$ of $G\setminus\{1\}$ is called minimal if $\langle S\rangle=G$ and there exists some $s\in S$ such that $\langle S\setminus\{s,s^{-1}\} \rangle\neq G$.…

Combinatorics · Mathematics 2022-05-11 Xueyi Huang , Kinkar Chandra Das

In this paper, we study self-complementary distance-regular Cayley graphs over abelian groups. We prove that if a regular graph is self-complementary distance-regular, then it is self-complementary strongly regular. We also deal with…

Combinatorics · Mathematics 2023-01-18 Mojtaba Jazaeri

The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…

Combinatorics · Mathematics 2022-03-25 Xueyi Huang , Kinkar Chandra Das , Lu Lu

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

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…

Combinatorics · Mathematics 2026-01-06 Amitayu Banerjee

For a finite group $G$ and subset $S$ of $G,$ the Haar graph $H(G,S)$ is a bipartite regular graph, defined as a regular $G$-cover of a dipole with $|S|$ parallel arcs labelled by elements of $S$. If $G$ is an abelian group, then $H(G,S)$…

Group Theory · Mathematics 2015-05-07 István Estélyi , Tomaž Pisanski

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

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

A subset $C$ of the vertex set of a graph $\Gamma$ is said to be $(\alpha,\beta)$-regular if $C$ induces an $\alpha$-regular subgraph and every vertex outside $C$ is adjacent to exactly $\beta$ vertices in $C$. In particular, if $C$ is an…

Combinatorics · Mathematics 2024-06-06 F. Seiedali , B. Khosravi , Z. Akhlaghi

We classify the distance-regular Cayley graphs with least eigenvalue $-2$ and diameter at most three. Besides sporadic examples, these comprise of the lattice graphs, certain triangular graphs, and line graphs of incidence graphs of certain…

Combinatorics · Mathematics 2016-04-28 Alireza Abdollahi , Edwin van Dam , Mojtaba Jazaeri

The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…

Combinatorics · Mathematics 2015-10-14 Mohammad Farrokhi Derakhshandeh Ghouchan , Mehdi Rajabian , Ahmad Erfanian

A partial difference set $S$ in a finite group $G$ satisfying $1 \notin S$ and $S = S^{-1}$ corresponds to an undirected strongly regular Cayley graph ${\rm Cay}(G,S)$. While the case when $G$ is abelian has been thoroughly studied, there…

Combinatorics · Mathematics 2020-09-17 Eric Swartz , Gabrielle Tauscheck

Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…

Combinatorics · Mathematics 2014-02-12 Alireza Abdollahi , Mojtaba Jazaeri

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

We obtain a complete classification of graph products of finite abelian groups whose Cayley graphs with respect to the standard presentations are planar.

Group Theory · Mathematics 2019-02-28 Olga Varghese

Let $G$ be a group and $S$ an inverse closed subset of $G\setminus \{1\}$. By a Cayley graph $Cay(G,S)$ we mean the graph whose vertex set is the set of elements of $G$ and two vertices $x$ and $y$ are adjacent if $x^{-1}y\in S$. A group…

Group Theory · Mathematics 2017-10-13 A. Abdollahi , M. Zallaghi

For any finite abelian group $G$ and any subset $S\seq G$, we determine the connectivity of the addition Cayley graph induced by $S$ on $G$. Moreover, we show that if this graph is not complete, then it possesses a minimum vertex cut of a…

Combinatorics · Mathematics 2007-10-08 David J. Grynkiewicz , Oriol Serra , Vsevolod Lev

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Combinatorics · Mathematics 2025-09-03 Noga Alon , Huy Tuan Pham

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. In this paper we give conditions for when a Cayley graph on an abelian group can be represented as a…

Combinatorics · Mathematics 2022-05-04 Joy Morris , Adrian Skelton

Let S be a finite generating set of a torsion-free, nilpotent group G. We show that every automorphism of the Cayley graph Cay(G;S) is affine. (That is, every automorphism of the graph is obtained by composing a group automorphism with…

Combinatorics · Mathematics 2016-03-14 Dave Witte Morris , Joy Morris , Gabriel Verret
‹ Prev 1 2 3 10 Next ›