English
Related papers

Related papers: Constructions of Strongly Regular Cayley Graphs an…

200 papers

In this paper we introduce a construction of directed strongly regular graphs from smaller ones using equitable partitions. Each equitable partition of a single DSRG satisfying several conditions leads to an infinite family of directed…

Combinatorics · Mathematics 2015-04-02 Štefan Gyürki

We construct two difference families on each of the cyclic groups of order 109, 145 and 247, and use them to construct skew-Hadamard matrices of orders 436, 580 and 988. Such difference families and matrices are constructed here for the…

Combinatorics · Mathematics 2009-03-18 Dragomir Z. Djokovic

Using cyclotomy, we construct a new infinite family of Neumaier graphs that includes infinitely many strongly regular graphs. Notably, this family conjecturally contains infinitely many graphs with coherent rank $6$. Our construction also…

Combinatorics · Mathematics 2025-04-17 Gary R. W. Greaves , Zhao Kuang Tan

(Strong) circular external difference families (which we denote as CEDFs and SCEDFs) can be used to construct nonmalleable threshold schemes. They are a variation of (strong) external difference families, which have been extensively studied…

Combinatorics · Mathematics 2023-10-30 Maura B. Paterson , Douglas R. Stinson

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

Let $C(d,k)$ and $AC(d,k)$ be the largest order of a Cayley graph and a Cayley graph based on an abelian group, respectively, of degree $d$ and diameter $k$. When $k=2$, it is well-known that $C(d,2)\le d^2+1$ with equality if and only if…

Combinatorics · Mathematics 2015-06-19 Alexander Pott , Yue Zhou

Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are…

Combinatorics · Mathematics 2018-10-18 Hadi Kharaghani , Sho Suda

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

It is known that the automorphism group of the elementary abelian $2$-group $Z_2^n$ is isomorphic to the general linear group $GL(n,F_2)$ of degree $n$ over $F_2$. Let $W$ be the collection of permutation matrices of order $n$. It is clear…

Combinatorics · Mathematics 2018-09-18 Lu Lu , Qiongxiang Huang , Jiangxia Hou

Using a Cayley complex (generalizing the Cayley graph) and Clifford algebras, we are able to give, for a large class of finitely presented groups, a uniform construction of spectral triples with $D_{+}$ of index 1.

Operator Algebras · Mathematics 2016-11-10 Sebastien Palcoux

In this paper, we construct an infinite family of normal Cayley graphs, which are $2$-distance-transitive but neither distance-transitive nor $2$-arc-transitive. This answers a question raised by Chen, Jin and Li in 2019 and corrects a…

Combinatorics · Mathematics 2021-02-23 Jun-Jie Huang , Yan-Quan Feng , Jin-Xin Zhou

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…

Combinatorics · Mathematics 2024-02-16 Martin Otto

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

Strongly regular graphs are regular graphs with a constant number of common neighbours between adjacent vertices, and a constant number of common neighbours between non-adjacent vertices. These graphs have been of great interest over the…

Group Theory · Mathematics 2025-10-30 William H. Allen

Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…

Combinatorics · Mathematics 2025-10-03 Nyumbu Chishwashwa , Vance Faber , Noah Streib

Let $C_{d,k}$ be the largest number of vertices in a Cayley digraph of degree $d$ and diameter $k$, and let $BC_{d,k}$ be the largest order of a bipartite Cayley digraph for given $d$ and $k$. For every degree $d\geq2$ and for every odd $k$…

Combinatorics · Mathematics 2017-03-24 Marcel Abas , Tomas Vetrik

A survey is given on mathematical structures which emerge in multi-loop Feynman diagrams. These are multiply nested sums, and, associated to them by an inverse Mellin transform, specific iterated integrals. Both classes lead to sets of…

Mathematical Physics · Physics 2015-06-17 J Ablinger , J Blümlein , C Schneider

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

We study structurable algebras of skew-dimension one. We present two different equivalent constructions for such algebras: one in terms of non-linear isotopies of cubic norm structures, and one in terms of hermitian cubic norm structures.…

Rings and Algebras · Mathematics 2017-12-05 Tom De Medts

Using a class of permutation polynomials of $F_{3^{2h+1}}$ obtained from the Ree-Tits symplectic spreads in $PG(3,3^{2h+1})$, we construct a family of skew Hadamard difference sets in the additive group of $F_{3^{2h+1}}$. With the help of a…

Combinatorics · Mathematics 2007-05-23 Cunsheng Ding , Zeying Wang , Qing Xiang