# Math 3511 Combinatorial Matrix Algorithms

## Fall 1998

*pp. 2-3:* "show (1.1) is equivalent to partitioning a rectangle".

*1.2:* 2, 3, 4, 5.

*1.3:* 1, 3, 4, 5.

*1.4:* 1.

*2.2:* 3, 4, 5, 6, 7, 8.

*2.3:* 2.

*2.4:* 2, 3, 6, 7, 8.

*2.5:* 1, 2.

*Laplacian handout:* Prove Theorem L2, Corollary L6, and
Proposition L8.

*2.6:* 2, 3, 4.

*5.1:* 1, 2, 3.

*5.2:* 1, 3, 4.

*T(m):* Verify that the triangluar graph T(m)
[on p. 152] is a strongly regular graph with the given parameters.

*srg-8:* Find all strongly regular graphs with 8 or
fewer vertices, and show your list is complete.

*5.3:* 1, 3, 4, 5.

*3.1:* 2, 3, 4.

*3.2:* 1, 2.