On the Exceptional Case in a Characterization of the Arcs of a Complete Graph
暂无分享,去创建一个
It is known that a certain simple set of properties characterize the relationship of adjacency of the n(n - 1)/2 arcs of the complete graph of order n, when n ≠ 8, and that these properties are not a sufficient characterization when n = 8 (see [1], [2], [3], [4], and [7]). The present paper describes a method for enumerating all counter-examples when n = 8.
[1] H. J. Ryser,et al. Geometries and Incidence Matrices , 1955 .
[2] On the number of absolute points of a correlation. , 1956 .
[3] S. S. Shrikhande. On a Characterization of the Triangular Association Scheme , 1959 .
[4] A. J. Hoffman,et al. On the Uniqueness of the Triangular Association Scheme , 1960 .