|
Discrete mathematics and mathematical cybernetics
The perfect colorings of circulant graphs with a large number of colors
M. A. Lisitsynaa, S. V. Avgustinovichb a Mozhaisky Military Space Academy, Zhdanovskaya, 13, 197198, St Petersburg, Russia
b Sobolev Institute of Mathematics, pr. Koptyuga, 4, 630090, Novosibirsk, Russia
Abstract:
An infinite circulant graph with a continuous set of distances is a graph, whose set of vertices is the set of integers, and two vertices $i$ and $j$ are adjacent if $|i-j| \in \{1,2,…,n\}$. We study perfect colorings of such graph with $k$ colors for $k$ at least $3n+3$. A complete description of them is obtained.
Keywords:
perfect coloring, infinite circulant graph, $k$-motley fragment.
Received November 24, 2023, published February 28, 2024
Citation:
M. A. Lisitsyna, S. V. Avgustinovich, “The perfect colorings of circulant graphs with a large number of colors”, Sib. Èlektron. Mat. Izv., 21:1 (2024), 188–195
Linking options:
https://www.mathnet.ru/eng/semr1676 https://www.mathnet.ru/eng/semr/v21/i1/p188
|
|