Siberian Federal University 
- Issue
- Journal of Siberian Federal University. Mathematics & Physics. 2014 7 (2)
- Authors
- Makhnev, Alexander A.; Nirova, Marina S.
- Contact information
- Makhnev, Alexander A.: Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Kovalevskaja, 16, Ekaterinburg, 620990, Russia;; Nirova, Marina S.:Kabardino-Balkarian State University, Chernyshevskogo, 28, Nalchik, 360000, Russia
- Keywords
- distance-regular graph; nearly n-gon
- Abstract
V.P.Burichenko and A.A.Makhnev have found intersection arrays of distance-regular graphs with = 2, μ > 1, having at most 1000 vertices. Earlier, intersection arrays of antipodal distance-regular graphs of diameter 3 with 6 2 and μ = 1 were obtained by the second author. In this paper, the possible intersection arrays of distance-regular graphs with = 2 and the number of vertices not greater than 4096 are obtained
- Pages
- 204–210
- Paper at repository of SibFU
- https://elib.sfu-kras.ru/handle/2311/10306
Journal of Siberian Federal University. Mathematics & Physics / On Distance-Regular Graphs with = 2
Full text (.pdf)