Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups
Combinatorics
2023-11-15 v1
Abstract
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 extension of the problem of characterizing strongly-regular Cayley graphs (or equivalently, regular partial difference sets). In this paper, we provide a partial characterization for distance-regular Cayley graphs over semi-dihedral groups and pseudo-semi-dihedral groups, both of which are -groups with a cyclic subgroup of index .
Keywords
Cite
@article{arxiv.2311.08128,
title = {Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups},
author = {Xueyi Huang and Lu Lu and Xiongfeng Zhan},
journal= {arXiv preprint arXiv:2311.08128},
year = {2023}
}
Comments
21 pages