论文信息 - Distance Regular Graphs

Distance Regular Graphs

Inequalities are obtained between the various parameters of a distance-regular graph. In particular, if k1 is the valency and k2 is the number of vertices at distance two from a given vertex, then in general k1 ⩽ k2. For distance-regular graphs of diameter at least four, k1=k2 if and only if the graph is simply a circuit. However when the diameter is two or three there are distance-regular graphs other than circuits for which k1=k2.

A. Neumaier | A. Brouwer | A. Cohen

[1] J. J. Seidel,et al. Equilateral point sets in elliptic geometry , 1966 .

[2] Derek H. Smith. Primitive and imprimitive graphs , 1971 .

[3] D. G. Higman. Coherent configurations , 1975 .

[4] J. J. Seidel,et al. A SURVEY OF TWO-GRAPHS , 1976 .

[5] B. Weisfeiler. On construction and identification of graphs , 1976 .

[6] D. E. Taylor. Regular 2‐Graphs , 1977 .

[7] R. Mathon. Symmetric Conference Matrices of Order pq 2 + 1 , 1978, Canadian Journal of Mathematics.