2000 character limit reached
On a family of divisible design digraphs
Published 8 Nov 2024 in math.CO | (2411.05386v1)
Abstract: For every odd prime power $q$, a family of pairwise nonisomorphic normal arc-transitive divisible design Cayley digraphs with isomorphic neighborhood designs over a Heisenberg group of order $q3$ is constructed. It is proved that these digraphs are not distinguished by the Weisfeiler-Leman algorithm and have the Weisfeiler-Leman dimension $3$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
