|
This article is cited in 1 scientific paper (total in 1 paper)
Discrete mathematics and mathematical cybernetics
New perfect colorings of infinite circulant graphs with continuous sets of distances
V. D. Plaksinaa, P. A. Shcherbinab 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.
Received March 10, 2021, published May 19, 2021
Citation:
V. D. Plaksina, P. A. Shcherbina, “New perfect colorings of infinite circulant graphs with continuous sets of distances”, Sib. Èlektron. Mat. Izv., 18:1 (2021), 530–533
Linking options:
https://www.mathnet.ru/eng/semr1378 https://www.mathnet.ru/eng/semr/v18/i1/p530
|
Statistics & downloads: |
Abstract page: | 131 | Full-text PDF : | 66 | References: | 19 |
|