A general construction of strictly Neumaier graphs and a related switching

A general construction of strictly Neumaier graphs and a related switching Full article

Journal

Discrete Mathematics
ISSN: 0012-365X , E-ISSN: 1872-681X

Output data

Year: 2023, Volume: 346, Number: 7, Article number : 113384, Pages count : 11 DOI: 10.1016/j.disc.2023.113384

Tags

edge-regular graph; regular clique; Neumaier graph

Authors

Evans Rhys J. ¹ , Goryainov Sergey ² , Konstantinova Elena V. ^1,3,4 , Mednykh Alexander D. ^1,3

Affiliations

1	Sobolev Institute of Mathematics, Ak. Koptyug av. 4, Novosibirsk, 630090, Russia
2	School of Mathematical Sciences, Hebei International Joint Research Center for Mathematics and Interdisciplinary Science, Hebei Normal University, Shijiazhuang 050024, P.R. China
3	Novosibirsk State University, Pirogova str. 2, Novosibirsk, 630090, Russia
4	Three Gorges Mathematical Research Center, China Three Gorges University, 8 University Avenue, Yichang 443002, Hubei Province, China

Funding (1)

Министерство науки и высшего образования РФ
Mathematical Center in Akademgorodok

075-15-2019-1613, 075-15-2022-281

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.

Evans R.J. , Goryainov S. , Konstantinova E.V. , Mednykh A.D.
A general construction of strictly Neumaier graphs and a related switching
Discrete Mathematics. 2023. V.346. N7. 113384 :1-11. DOI: 10.1016/j.disc.2023.113384 WOS Scopus РИНЦ OpenAlex

Submitted:	Apr 19, 2022
Accepted:	Feb 11, 2023
Published online:	Mar 3, 2023
Published print:	Jul 13, 2023

Web of science:	WOS:000953117800001
Scopus:	2-s2.0-85149374583
Elibrary:	60914488
OpenAlex:	W3202996343

DB	Citing
OpenAlex	1