|
Diskretnyi Analiz i Issledovanie Operatsii, 2014, Volume 21, Issue 2, Pages 76–83
(Mi da768)
|
|
|
|
This article is cited in 12 scientific papers (total in 12 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.
Received: 22.05.2013 Revised: 08.07.2013
Citation:
O. G. Parshina, “Perfect $2$-colorings of infinite circulant graphs with a continuous set of distances”, Diskretn. Anal. Issled. Oper., 21:2 (2014), 76–83; J. Appl. Industr. Math., 8:3 (2014), 357–361
Linking options:
https://www.mathnet.ru/eng/da768 https://www.mathnet.ru/eng/da/v21/i2/p76
|
Statistics & downloads: |
Abstract page: | 374 | Full-text PDF : | 167 | References: | 66 | First page: | 13 |
|