Graph $\Gamma_i$ for a distance-regular graph $\Gamma$ of diameter 3 can be strongly regular for $i=2$ or $i=3$. Finding parameters of $\Gamma_i$ by the intersection array of graph $\Gamma$ is a direct problem. Finding intersection array of graph $\Gamma$ by the parameters of $\Gamma_i$ is an inverse problem. Earlier direct and inverse problems have been solved by A.A. Makhnev, M.S. Nirova for $i=3$ and by A.A. Makhnev and D.V. Paduchikh for $i=2$. In this work the inverse problem has been solved in cases when graphs $\Gamma_2$, $\Gamma_3$, $\bar \Gamma_2$ or $\bar \Gamma_3$ are pseudo-geometric for generalized quadrangle. In particular, graphs $\Gamma_2$ and $\bar \Gamma_3$ are not to be a pseudo-geometric for generalized quadrangle.
A. A. Makhnev; M. S. Nirova. Inverse problems of graph theory: generalized quadrangles. Sibirskie èlektronnye matematičeskie izvestiâ, Tome 15 (2018), pp. 927-934. http://geodesic.mathdoc.fr/item/SEMR_2018_15_a71/
@article{SEMR_2018_15_a71,
author = {A. A. Makhnev and M. S. Nirova},
title = {Inverse problems of graph theory: generalized quadrangles},
journal = {Sibirskie \`elektronnye matemati\v{c}eskie izvesti\^a},
pages = {927--934},
year = {2018},
volume = {15},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/SEMR_2018_15_a71/}
}
TY - JOUR
AU - A. A. Makhnev
AU - M. S. Nirova
TI - Inverse problems of graph theory: generalized quadrangles
JO - Sibirskie èlektronnye matematičeskie izvestiâ
PY - 2018
SP - 927
EP - 934
VL - 15
UR - http://geodesic.mathdoc.fr/item/SEMR_2018_15_a71/
LA - ru
ID - SEMR_2018_15_a71
ER -
%0 Journal Article
%A A. A. Makhnev
%A M. S. Nirova
%T Inverse problems of graph theory: generalized quadrangles
%J Sibirskie èlektronnye matematičeskie izvestiâ
%D 2018
%P 927-934
%V 15
%U http://geodesic.mathdoc.fr/item/SEMR_2018_15_a71/
%G ru
%F SEMR_2018_15_a71