On a family of divisible design digraphs
Combinatorics
2024-11-11 v1
Abstract
For every odd prime power , a family of pairwise nonisomorphic normal arc-transitive divisible design Cayley digraphs with isomorphic neighborhood designs over a Heisenberg group of order is constructed. It is proved that these digraphs are not distinguished by the Weisfeiler-Leman algorithm and have the Weisfeiler-Leman dimension .
Keywords
Cite
@article{arxiv.2411.05386,
title = {On a family of divisible design digraphs},
author = {Mikhail Muzychuk and Grigory Ryabov},
journal= {arXiv preprint arXiv:2411.05386},
year = {2024}
}
Comments
14 pages