arXiv · 1612.01360
Completely regular codes in the infinite hexagonal grid
Abstract
A set $C$ of vertices of a simple graph is called a completely regular code if for each $i=0$, $1$, $2$, \ldots and $j = i-1$, $i$, $i+1$, all vertices at distance $i$ from $C$ have the same number $s_{ij}$ of neighbors at distance $j$ from $C$. We characterize the completely regular codes in the infinite hexagonal grid graph.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Sergey V. Avgustinovich, Denis S. Krotov, Anastasia Yu. Vasil'eva. 2016-11-30. Completely regular codes in the infinite hexagonal grid. https://doi.org/10.17377/semi.2016.13.079
Cite the original work for its findings. Save a collection to share your selection of sources.