Research output: Contribution to journal › Article › peer-review
Generalised dual Seidel switching and Deza graphs with strongly regular children. / Kabanov, Vladislav V.; Konstantinova, Elena V.; Shalaginov, Leonid.
In: Discrete Mathematics, Vol. 344, No. 3, 112238, 03.2021.Research output: Contribution to journal › Article › peer-review
}
TY - JOUR
T1 - Generalised dual Seidel switching and Deza graphs with strongly regular children
AU - Kabanov, Vladislav V.
AU - Konstantinova, Elena V.
AU - Shalaginov, Leonid
N1 - Funding Information: The work is supported by Mathematical Center in Akademgorodok under agreement No. 075-15-2019-1613 with the Ministry of Science and Higher Education of the Russian Federation. The research of the first and the second authors is partially funded by RFBR according to the research project 17-51-560008 . The third author is partially supported by RFBR according to the research project 20-51-53023 . The main results of the paper were obtained during workshops on Algebraic Graph Theory held on November 5–8, 2019, and on March 14–17, 2020, Akademgorodok, Novosibirsk, Russia. Publisher Copyright: © 2020 Elsevier B.V. Copyright: Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2021/3
Y1 - 2021/3
N2 - A Deza graph G with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two distinct vertices have b or a common neighbours, where b⩾a. The children GA and GB of a Deza graph G are defined on the vertex set of G such that every two distinct vertices are adjacent in GA or GB if and only if they have a or b common neighbours, respectively. In this paper we present a general approach to dual Seidel switching and investigate Deza graphs whose children are strongly regular graphs.
AB - A Deza graph G with parameters (n,k,b,a) is a k-regular graph with n vertices such that any two distinct vertices have b or a common neighbours, where b⩾a. The children GA and GB of a Deza graph G are defined on the vertex set of G such that every two distinct vertices are adjacent in GA or GB if and only if they have a or b common neighbours, respectively. In this paper we present a general approach to dual Seidel switching and investigate Deza graphs whose children are strongly regular graphs.
KW - Deza graph
KW - Dual Seidel switching
KW - Strictly Deza graph
KW - Strongly regular graph
UR - http://www.scopus.com/inward/record.url?scp=85097099097&partnerID=8YFLogxK
U2 - 10.1016/j.disc.2020.112238
DO - 10.1016/j.disc.2020.112238
M3 - Article
AN - SCOPUS:85097099097
VL - 344
JO - Discrete Mathematics
JF - Discrete Mathematics
SN - 0012-365X
IS - 3
M1 - 112238
ER -
ID: 26203244