Divisible design graphs obtained by plugging a difference set into a construction for antipodal distance-regular graphs of diameter 3

IF 1.2 2区数学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Designs, Codes and Cryptography Pub Date : 2026-08-08 DOI:10.1007/s10623-026-01922-x

Bart De Bruyn, Sergey Goryainov, Ruilin Ma, Ruihan Xie

引用次数: 0

Abstract

In this paper, we present a new construction of divisible design graphs with new parameters, obtained by plugging a difference set of a quotient group into a known construction of antipodal distance-regular graphs of diameter 3. Also, we show that in characteristic 2 the new divisible design graphs are Cayley graphs over an elementary abelian 2-group.

查看原文本刊更多论文

将一个差分集代入直径为3的对映距离正则图的构造中得到可整除的设计图

本文通过将商群的差集代入已知的直径为3的对映距离正则图的构造中，得到了具有新参数的可整除设计图的新构造。此外，我们还证明了在特征2中，新的可分设计图是一个初等阿贝尔2群上的Cayley图。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Designs, Codes and Cryptography 工程技术-计算机：理论方法

CiteScore

2.80

自引率

12.50%

发文量

157

审稿时长

16.5 months

期刊介绍： Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines. The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome. The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas. Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.