On WL-rank and WL-dimension of some Deza dihedrants
Combinatorics
2021-12-14 v2
Abstract
The WL-rank of a graph is defined to be the rank of the coherent configuration of . The WL-dimension of is defined to be the smallest positive integer for which is identified by the -dimensional Weisfeiler-Leman algorithm. We establish that some families of strictly Deza dihedrants have WL-rank or and WL-dimension . Computer calculations imply that every strictly Deza dihedrant with at most vertices is circulant or belongs to one of the above families. We also construct a new infinite family of strictly Deza dihedrants whose WL-rank is a linear function of the number of vertices.
Keywords
Cite
@article{arxiv.2109.15182,
title = {On WL-rank and WL-dimension of some Deza dihedrants},
author = {Grigory Ryabov and Leonid Shalaginov},
journal= {arXiv preprint arXiv:2109.15182},
year = {2021}
}
Comments
14 pages