Graphs and association schemes, algebra and geometry
J.J. Seidel, Aart Blokhuis, HA Henny Wilbrink, JP Boly, van Cpm Stan Hoesel · TU/e Research Portal · 1983
Members and lectures.Ch. I.Graphs and their spectra.1.1.Introduction.1.2.Graphs with largest eigenvalue 2. 1.3.Line graphs.1.4.The switching classes of T(S), T(8).L 2 (4).1.5.Graphs with smallest eigenvalue -2.1.6.The theorem of Turan about the largest coclique in a graph; an application to coding theory.Ch. 2. Eigenvalue techniques in graph and design theory.App.3.2.The A-module.II Ch. 4. Pseudo-cyclic association schemes.4.1.A theorem. 4.2.Pseudo-cyclic associatjon schemes with 3 classes 66 69 72 72 on 28 vertices.75 m 4.3.Pseudo-cyclic association schemes from PSL(2,q), q=2 • 81 Ch. 5. Few distance sets.5.1.Spherical s-distance sets.5.2.The mod p bound.5.3.Equiangular lines.5.4.Sets of equiangular lines 1n R d , with angle arccos(l/3).5.5.Two-graphs.Ch. 6.Some problems from combinatorial geometry.6.1.Introduction.6.2.Sets of points with no obtuse angles.3 1 • .d o •• lsosce es pOlnt sets In R • References.