On WL-rank of Deza Cayley graphs
Combinatorics
2021-11-04 v1
Abstract
The WL-rank of a digraph is defined to be the rank of the coherent configuration of . We construct a new infinite family of strictly Deza Cayley graphs for which the WL-rank is equal to the number of vertices. The graphs from this family are divisible design and integral.
Cite
@article{arxiv.2105.11746,
title = {On WL-rank of Deza Cayley graphs},
author = {Dmitry Churikov and Grigory Ryabov},
journal= {arXiv preprint arXiv:2105.11746},
year = {2021}
}
Comments
7 pages. arXiv admin note: text overlap with arXiv:2012.13898