On completely regular codes with minimum eigenvalue in geometric graphs Научная публикация
| Журнал |
Discrete Mathematics
ISSN: 0012-365X , E-ISSN: 1872-681X |
||
|---|---|---|---|
| Вых. Данные | Год: 2023, Том: 346, Номер: 7, Номер статьи : 113357, Страниц : 13 DOI: 10.1016/j.disc.2023.113357 | ||
| Ключевые слова | Completely regular code; Delsarte clique; Geometric graph; Johnson graph; Reconstruction; t-design | ||
| Авторы |
|
||
| Организации |
|
Информация о финансировании (1)
| 1 | Российский научный фонд | 22-21-00135 |
Реферат:
We prove that any completely regular code with minimum eigenvalue in any geometric graph Γ corresponds to a completely regular code in the clique graph of Γ. Studying the interrelation of these codes, a complete characterization of the completely regular codes in the Johnson graphs J(n,w) with covering radius w−1 and strength 1 is obtained. In particular this result finishes a characterization of the completely regular codes in the Johnson graphs J(n,3). We also classify the completely regular codes of strength 1 in the Johnson graphs J(n,4) with only one case for the eigenvalues left open.
Библиографическая ссылка:
Mogilnykh I.Y.
, Vorob'ev K.V.
On completely regular codes with minimum eigenvalue in geometric graphs
Discrete Mathematics. 2023. V.346. N7. 113357 :1-13. DOI: 10.1016/j.disc.2023.113357 WOS Scopus РИНЦ OpenAlex
On completely regular codes with minimum eigenvalue in geometric graphs
Discrete Mathematics. 2023. V.346. N7. 113357 :1-13. DOI: 10.1016/j.disc.2023.113357 WOS Scopus РИНЦ OpenAlex
Даты:
| Поступила в редакцию: | 5 июн. 2022 г. |
| Принята к публикации: | 24 янв. 2023 г. |
| Опубликована online: | 1 мар. 2023 г. |
| Опубликована в печати: | 20 июл. 2023 г. |
Идентификаторы БД:
| Web of science: | WOS:000950570700001 |
| Scopus: | 2-s2.0-85149317861 |
| РИНЦ: | 60872480 |
| OpenAlex: | W4322738869 |