Strongly regular graph proof
June 18th, 2023
Let n >= 2 be a number. Define the graph L2(n) as follows: Vertices are ordered pairs from the set {1, …, n}. Two vertices are adjacent if they have the same first coordinate, or the same second coordinate (but not both).
Show that this is a strongly regular graph, and find its parameters.