This article is cited in 11 papers

Perfect $2$-colorings of infinite circulant graphs with a continuous set of distances

O. G. Parshina

Novosibirsk State University, 2 Pirogov St., 630090 Novosibirsk, Russia

Abstract: We consider perfect colorings of infinite circulant graphs with a set of distances forming a segment of natural numbers $[1,n]$. We give a complete description of perfect colorings in two colors of these graphs and list all their admissible parameters. Bibliogr. 5.

Keywords: perfect coloring, circulant graph.

UDC: 519.87

Received: 22.05.2013
Revised: 08.07.2013

 English version: Journal of Applied and Industrial Mathematics, 2014, 8:3, 357–361

Bibliographic databases:

•