V. D. Plaksina, P. A. Shcherbina, “New perfect colorings of infinite circulant graphs with continuous sets of distances”, Sib. Èlektron. Mat. Izv., 2021, Volume 18, Issue 1,Pages <nobr>530

This article is cited in 1 paper

Discrete mathematics and mathematical cybernetics

New perfect colorings of infinite circulant graphs with continuous sets of distances

V. D. Plaksina^a, P. A. Shcherbina^b

^a Sobolev Institute of Mathematics, 4, Koptyuga ave., Novosibirsk, 630090, Russia
^b Budyonny Military Academy of the Signal Corps, 3, Tikhoretsky ave., St. Petersburg, 194064, Russia

Abstract: This paper presents series of perfect colorings of circulant graphs with continuous set of n distances, which disproves the hypothesis [2] that period of such a coloring is orbital or has length at most $2n+2$.

Keywords: perfect coloring, equitable partition, circulant graph, Cayley graph.

UDC: 519.174.7

MSC: 05C15

Received March 10, 2021, published May 19, 2021

Language: English

DOI: 10.33048/semi.2021.18.038