English
Related papers

Related papers: Distance-regular Cayley graphs over dicyclic group…

200 papers

In this note, we provide several constructions of Deza Cayley graphs over groups having a generalized dihedral subgroup. These constructions are based on a usage of (relative) difference sets.

Combinatorics · Mathematics 2026-01-15 Grigory Ryabov

The degree-diameter problem seeks to find the largest possible number of vertices in a graph having given diameter and given maximum degree. Very often the problem is studied for restricted families of graph such as vertex-transitive or…

Combinatorics · Mathematics 2018-04-13 Grahame Erskine , James Tuite

In this paper, we study the problem that which of distance-regular graphs admit a perfect $1$-code. Among other results, we characterize distance-regular line graphs which admit a perfect $1$-code. Moreover, we characterize all known…

Combinatorics · Mathematics 2023-01-18 Mojtaba Jazaeri

In this paper the structure of the Cayley graphs and G-graphs of some gyro-groups are studied and some properties of them will be proved. Moreover we review some special gyro-groups including: gyro-commutative gyrogroups, dihedral…

Combinatorics · Mathematics 2024-05-01 Neda Moradi , Gholam Hossein Fath-Tabara , Alain Bretto

The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. A bipartite graph is distance-biregular when it is…

Combinatorics · Mathematics 2013-04-17 M. A. Fiol

A digraph is called an $n$-Cayley digraph if its automorphism group has an $n$-orbit semiregular subgroup. We determine the splitting fields of $n$-Cayley digraphs over abelian groups and compute a bound on their algebraic degrees, before…

Combinatorics · Mathematics 2024-01-17 Hao Li , Xiaogang Liu

A Cayley hyper-digraph is a directed hypergraph that its automorphism group contains a subgroup acting regularly on vertices and a Cayley hypermap is a hypermap whose automorphism group contains a subgroup which induces regular action on…

Combinatorics · Mathematics 2025-04-28 Kai Yuan , Yan Wang

A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to $S$ is said to be normal if the right regular representation of $G$ is normal in the automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if there is $\alpha\in Aut(G)$…

Combinatorics · Mathematics 2021-06-03 Jin-Hua Xie , Yan-Quan Feng , Jin-Xin Zhou

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

A regular $t$-balanced Cayley map on a group $\Gamma$ is an embedding of a Cayley graph on $\Gamma$ into a surface with certain special symmetric properties. We completely classify regular $t$-balanced Cayley maps for a class of split…

Combinatorics · Mathematics 2024-02-09 Haimiao Chen , Jingrui Zhang

Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…

Combinatorics · Mathematics 2024-09-04 Ján Mináč , Tung T. Nguyen , Nguyen Duy Tân

The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In this paper, we consider this problem for $m$-Cayley digraphs…

Combinatorics · Mathematics 2024-09-04 Xing Zhang , Yuan-Quan Feng , Fu-Gang Yin , Jin-Xin Zhou

Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…

Combinatorics · Mathematics 2013-09-27 A. Abiad , C. Dalfò , M. A. Fiol

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

A few properties of unitary Cayley graphs are explored using their eigenvalues. It is shown that the adjacency algebra of a unitary Cayley graph is a coherent algebra. Finally, a class of unitary Cayley graphs that are distance regular are…

Number Theory · Mathematics 2017-07-11 A. Satyanarayana Reddy

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

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

In this paper,we construct some directed strongly regular Cayley graphs on dihedral groups,these generalizes some earlier constructions.We also characterize some certain directed strongly regular Cayley graphs on dihedral groups…

Combinatorics · Mathematics 2019-09-20 Yiqin He , Bicheng Zhang , Rongquan Feng

A Shilla distance-regular graph G (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divides k for a Shilla distance-regular graph G, and for G we…

Combinatorics · Mathematics 2009-02-24 Jack H. Koolen , Jongyook Park

The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups. One fundamental use of our ``dense graphs''…

Combinatorics · Mathematics 2008-02-03 Michael J. Dinneen , Paul R. Hafner