## Eigenvalue techniques in design and graph theory, Issue 121 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Common terms and phrases

2-design 4-colourable adjacency matrix Algebra Appendix average row sums bipartite graph block matrices blocks incident blocks of type bound chromatic number class graph coclique colourable strongly regular Combinatorial complement complete graphs constant row Define denote disjoint union distinct eigenvalues eigenvalues of G eigenvectors equality holds follows geometry with parameters Gewirtz graph graph G graph with parameters HAEMERS Hence hermitian hexagon of order HIGMAN Higman-Sims technique HOFFMAN Hoffman-Singleton graph implies incidence graph incidence matrix incidence structure induced subgraph inequalities integer interlace the eigenvalues intersection numbers ISBN 90 J.H. van LINT LEMMA Let G line graph Math MATHON matrix of G multiplicity n-gon non-isomorphic order s,t parameter set partial geometry partitioned point graph points in common PROOF proves pseudo-geometric graph quadrangle of order rank respectively result Shrikhande graph singular values strongly regular graph subdesign subgraph of G Suppose G symmetric theorem vertex vertices of G X_(G yields