Standard

A general construction of strictly Neumaier graphs and a related switching. / Evans, Rhys J.; Goryainov, Sergey; Konstantinova, Elena V. и др.

в: Discrete Mathematics, Том 346, № 7, 113384, 07.2023.

Результаты исследований: Научные публикации в периодических изданиях › статья › Рецензирование

Harvard

Evans, RJ, Goryainov, S, Konstantinova, EV & Mednykh, AD 2023, 'A general construction of strictly Neumaier graphs and a related switching', Discrete Mathematics, Том. 346, № 7, 113384. https://doi.org/10.1016/j.disc.2023.113384

APA

Evans, R. J., Goryainov, S., Konstantinova, E. V., & Mednykh, A. D. (2023). A general construction of strictly Neumaier graphs and a related switching. Discrete Mathematics, 346(7), [113384]. https://doi.org/10.1016/j.disc.2023.113384

Vancouver

Evans RJ, Goryainov S, Konstantinova EV, Mednykh AD. A general construction of strictly Neumaier graphs and a related switching. Discrete Mathematics. 2023 июль;346(7):113384. doi: 10.1016/j.disc.2023.113384

Author

Evans, Rhys J. ; Goryainov, Sergey ; Konstantinova, Elena V. и др. / A general construction of strictly Neumaier graphs and a related switching. в: Discrete Mathematics. 2023 ; Том 346, № 7.

BibTeX

@article{6a39f5e4bc5b481ab19626ffb730223c,
title = "A general construction of strictly Neumaier graphs and a related switching",
abstract = "We present a construction of Neumaier graphs with nexus 1, which generalises two known constructions of Neumaier graphs. We also use W. Wang, L. Qiu, and Y. Hu switching to show that we construct cospectral Neumaier graphs. Finally, we show that several small strictly Neumaier graphs can be obtained from our construction, and give a geometric or algebraic description for each of these graphs.",
keywords = "Edge-regular graph, Neumaier graph, Perfect code, Regular clique, WQH-switching",
author = "Evans, {Rhys J.} and Sergey Goryainov and Konstantinova, {Elena V.} and Mednykh, {Alexander D.}",
note = "The work of R. J. Evans, E. V. Konstantinova, and A. D. Mednykh was supported by the Mathematical Center in Akademgorodok, under agreement No. 075-15-2022-281 with the Ministry of Science and High Education of the Russian Federation . S. Goryainov also thanks Mathematical Center in Akademgorodok for organising his visit in Akademgorodok in July 2021. Finally, S. Goryainov and E. V. Konstantinova thank D. Krotov for useful discussions. Публикация для корректировки.",
year = "2023",
month = jul,
doi = "10.1016/j.disc.2023.113384",
language = "English",
volume = "346",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "7",

}

RIS

TY - JOUR

T1 - A general construction of strictly Neumaier graphs and a related switching

AU - Evans, Rhys J.

AU - Goryainov, Sergey

AU - Konstantinova, Elena V.

AU - Mednykh, Alexander D.

N1 - The work of R. J. Evans, E. V. Konstantinova, and A. D. Mednykh was supported by the Mathematical Center in Akademgorodok, under agreement No. 075-15-2022-281 with the Ministry of Science and High Education of the Russian Federation . S. Goryainov also thanks Mathematical Center in Akademgorodok for organising his visit in Akademgorodok in July 2021. Finally, S. Goryainov and E. V. Konstantinova thank D. Krotov for useful discussions. Публикация для корректировки.

PY - 2023/7

Y1 - 2023/7

N2 - We present a construction of Neumaier graphs with nexus 1, which generalises two known constructions of Neumaier graphs. We also use W. Wang, L. Qiu, and Y. Hu switching to show that we construct cospectral Neumaier graphs. Finally, we show that several small strictly Neumaier graphs can be obtained from our construction, and give a geometric or algebraic description for each of these graphs.

AB - We present a construction of Neumaier graphs with nexus 1, which generalises two known constructions of Neumaier graphs. We also use W. Wang, L. Qiu, and Y. Hu switching to show that we construct cospectral Neumaier graphs. Finally, we show that several small strictly Neumaier graphs can be obtained from our construction, and give a geometric or algebraic description for each of these graphs.

KW - Edge-regular graph

KW - Neumaier graph

KW - Perfect code

KW - Regular clique

KW - WQH-switching

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-85149374583&origin=inward&txGid=7b7ef52fd4b86d8a837608f65e68fd15

UR - https://www.mendeley.com/catalogue/65778345-5dd7-38d8-88d4-09e3ed91ae21/

U2 - 10.1016/j.disc.2023.113384

DO - 10.1016/j.disc.2023.113384

M3 - Article

VL - 346

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 7

M1 - 113384

ER -

ID: 59256778