SEIDEL-EQUIVALENCE AND EMBEDDING OF STRONGLY REGULAR GRAPHS.
Abstract
Necessary conditions for existence of partially balanced incomplete block designs with non-L sub 2(4) and non-T(8) association schemes are derived. These are based on the facts that the non-L sub 2(4) scheme is Seidel-equivalent to the L sub 2(4) scheme and the three non-T(8) schemes are Seidel-equivalent to the T(8). Necessary conditions for embedding of a strongly regular graph on v vertices in a strongly regular graph on v + 1 vertices are also obtained and some new association schemes are constructed. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jul 01, 1967
- Accession Number
- AD0662733
Entities
People
- S. S. Shrikhande
Organizations
- University of Wisconsin–Madison