Completely regular codes in the infinite hexagonal grid Full article
| Journal |
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports)
, E-ISSN: 1813-3304 |
||
|---|---|---|---|
| Output data | Year: 2016, Volume: 13, Pages: 987-1016 Pages count : 30 DOI: 10.17377/semi.2016.13.079 | ||
| Tags | completely regular code, perfect coloring, equitable partition, partition design, hexagonal grid | ||
| Authors |
|
||
| Affiliations |
|
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 s(i,j) of neighbors at distance j from C. We characterize the completely regular codes in the infinite hexagonal grid graph.
Cite:
Avgustinovich S.V.
, Krotov D.S.
, Vasil'eva A.Y.
Completely regular codes in the infinite hexagonal grid
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2016. V.13. P.987-1016. DOI: 10.17377/semi.2016.13.079 WOS Scopus РИНЦ OpenAlex
Completely regular codes in the infinite hexagonal grid
Сибирские электронные математические известия (Siberian Electronic Mathematical Reports). 2016. V.13. P.987-1016. DOI: 10.17377/semi.2016.13.079 WOS Scopus РИНЦ OpenAlex
Dates:
| Submitted: | Apr 15, 2016 |
| Published online: | Nov 15, 2016 |
Identifiers:
| Web of science: | WOS:000407781100079 |
| Scopus: | 2-s2.0-85032694238 |
| Elibrary: | 28127211 |
| OpenAlex: | W2560252601 |