Graphs related to $2$-dimensional simplex codes
Combinatorics
2019-08-13 v1
Abstract
We give a complete description of the distance relation on the graph of -ary simplex codes of dimension . This is a connected graph of diameter . For every vertex we determine the sets of all vertices at distance and describe their symmetries.
Keywords
Cite
@article{arxiv.1908.03703,
title = {Graphs related to $2$-dimensional simplex codes},
author = {Mariusz Kwiatkowski and Mark Pankov},
journal= {arXiv preprint arXiv:1908.03703},
year = {2019}
}