Distance-regular Cayley graphs over (pseudo-) semi-dihedral groups
Xueyi Huang, Lu Lu, Xiongfeng Zhan
Abstract
Open-access reader
Xueyi Huang, Lu Lu, Xiongfeng Zhan
Abstract
Open-access reader
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavič and Potoč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 $2$-groups with a cyclic subgroup of index $2$.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Distance-regular graphs are a class of regualr graphs with pretty combinatorial symmetry. In 2007, Miklavič and Potoč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 $2$-groups with a cyclic subgroup of index $2$.
Key concepts: Dihedral group, Cayley graph, Mathematics, Combinatorics, Dihedral angle, Chordal graph, Cayley's theorem, Discrete mathematics