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, … and j = i-1, i, i+1, all vertices at distance i from C have the same number sij of neighbors at distance j from C. We characterize the completely regular codes in the infinite hexagonal grid graph.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.