Inverse problems of graph theory: graphs without triangles

Graph $\Gamma_i$ for a distance-regular graph $\Gamma$ of diameter 3 can be strongly regular for $i=2$ or $i=3$. 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 it is consider the case when graph $\Gamma_3$ is strongly regular without triangles and $v\le 100000$.