|
|
Sibirskii Matematicheskii Zhurnal, 2011, Volume 52, Number 1, Pages 115–132
(Mi smj2182)
|
|
|
|
This article is cited in 8 scientific papers (total in 8 papers)
On periodicity of perfect colorings of the infinite hexagonal and triangular grids
S. A. Puzyninaab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
b University of Turku, Finland
Abstract:
A coloring of vertices of a graph $G$ is called $r$-perfect, if the color structure of each ball of radius $r$ in $G$ depends only on the color of the center of the ball. The parameters of a perfect coloring are given by the matrix $A=(a_{ij})^n_{i,j=1}$, where $n$ is the number of colors and $a_{ij}$ is the number of vertices of color $j$ in a ball centered at a vertex of color $i$. We study the periodicity of perfect colorings of the graphs of the infinite hexagonal and triangular grids. We prove that for every 1-perfect coloring of the infinite triangular and every 1- and 2-perfect coloring of the infinite hexagonal grid there exists a periodic perfect coloring with the same matrix. The periodicity of perfect colorings of big radii have been studied earlier.
Keywords:
perfect coloring, equitable partition, infinite graph, hexagonal grid, triangular grid, periodicity.
Received: 02.09.2009 Revised: 15.11.2010
Citation:
S. A. Puzynina, “On periodicity of perfect colorings of the infinite hexagonal and triangular grids”, Sibirsk. Mat. Zh., 52:1 (2011), 115–132; Siberian Math. J., 52:1 (2011), 91–104
Linking options:
https://www.mathnet.ru/eng/smj2182 https://www.mathnet.ru/eng/smj/v52/i1/p115
|
|