The maximum number of vertices of primitive regular graphs of orders 2, 3, 4 with exponent 2

Abstract

In 2015, the results were obtained for the maximum number of vertices nk in regular graphs of a given order k with a diameter 2: n2 = 5, n3 = 10, n4 = 15. In this paper, we investigate a similar question about the largest number of vertices npk in a primitive regular graph of order k with exponent 2. All primitive regular graphs with exponent 2, except for the complete one, also have diameter d = 2. The following values were obtained for primitive regular graphs with exponent 2: np2 = 3, np3 = 4, np4 = 11.