Every two-graph is equivalent to a set of lines in some dimensional euclidean space each pair of which meet in the same angle.
With the notation as above, the maximum cardinality n satisfies n ≤ d(ρ2 - 1)/(ρ2 - d) and the bound is achieved if and only if the two-graph is regular.