Quantcast

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

Research paper by O. G. Parshina

Indexed on: 22 Aug '14Published on: 22 Aug '14Published in: Journal of Applied and Industrial Mathematics



Abstract

We study the perfect colorings of infinite circulant graphs whose set of distances constitutes the segment of naturals [1, n]. We give a complete description of the perfect colorings of these graphs with two colors and list all their admissible parameters.