Completely regular codes in the infinite hexagonal grid

DOI10.17377/SEMI.2016.13.079MaRDI QIDQ2402205zbMATH OpenOpenAlexFDO

Authors Denis S. Krotov, A. Yu. Vasil'eva, Sergey Avgustinovich

Publication date 6 September 2017

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1612.01360

zbMATH Keywords

completely regular codeequitable partitionhexagonal gridperfect coloringpartition design

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Applications of graph theory to circuits and networks (94C15) Theory of error-correcting codes and error-detecting codes (94B99)

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.

Recommendations

• New bounds on the minimum density of an identifying code for the infinite hexagonal grid
• Codes from generalized hexagons
• On completely regular codes
• A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
• Bounds for codes identifying vertices in the hexagonal grid
• Total perfect codes in grid graphs
• Identifying codes for infinite triangular grids with a finite number of rows
• On complete regularity of extended codes
• The number of completely different optimal identifying codes in the infinite square grid
• Improved Bounds forr-Identifying Codes of the Hex Grid

Cited in

(6)

• On completely regular codes
• On perfect colorings of paths divisible by a matching
• The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances
• Perfect colorings of the infinite square grid: coverings and twin colors
• Completely regular codes in the \(n\)-dimensional rectangular grid
• Modeling hexagonal constellations with Eisenstein-Jacobi graphs

This page was built for publication: Completely regular codes in the infinite hexagonal grid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2402205)