have ? common neighbours.
* Every two non-adjacent vertices have u common neighbours.

A graph of this kind is sometimes said to be a srg(v, k, ?, u).

Some authors exclude graphs which satisfy the definition trivially, namely those graphs which are the disjoint union of one or more equal-sized complete graphs, and their complements, the Turán graphs.

Young tableaux

A Young tableau

1.Previous
3.Next