Perfect 2‐colorings of Hamming graphs Научная публикация
| Журнал |
Journal of Combinatorial Designs
ISSN: 1063-8539 |
||||
|---|---|---|---|---|---|
| Вых. Данные | Год: 2021, Том: 29, Номер: 6, Страницы: 367-396 Страниц : 30 DOI: 10.1002/jcd.21771 | ||||
| Ключевые слова | equitable partition, graph covering, Hamming graph, perfect code, perfect coloring | ||||
| Авторы |
|
||||
| Организации |
|
Реферат:
We consider the problem of existence of perfect 2-colorings (equitable 2-partitions) of Hamming graphs with given parameters. We start with conditions on parameters of graphs and colorings that are necessary for their existence. Next we observe known constructions of perfect colorings and propose some new ones giving new parameters. At last, we deduce which parameters of colorings are covered by these constructions and give tables of admissible parameters of 2-colorings in Hamming graphs for small and . Using the connection with perfect colorings, we construct an orthogonal array A(2048, 7, 4, 5).
Библиографическая ссылка:
Bespalov E.A.
, Krotov D.S.
, Matiushev A.A.
, Taranenko A.A.
, Vorob'ev K.V.
Perfect 2‐colorings of Hamming graphs
Journal of Combinatorial Designs. 2021. V.29. N6. P.367-396. DOI: 10.1002/jcd.21771 WOS Scopus РИНЦ OpenAlex
Perfect 2‐colorings of Hamming graphs
Journal of Combinatorial Designs. 2021. V.29. N6. P.367-396. DOI: 10.1002/jcd.21771 WOS Scopus РИНЦ OpenAlex
Даты:
| Поступила в редакцию: | 16 февр. 2020 г. |
| Принята к публикации: | 8 февр. 2021 г. |
| Опубликована online: | 10 мар. 2021 г. |
Идентификаторы БД:
| Web of science: | WOS:000627028000001 |
| Scopus: | 2-s2.0-85102249444 |
| РИНЦ: | 46806514 |
| OpenAlex: | W3133704031 |