Accession Number : AD0662733
Title : SEIDEL-EQUIVALENCE AND EMBEDDING OF STRONGLY REGULAR GRAPHS.
Descriptive Note : Technical summary rept.,
Corporate Author : WISCONSIN UNIV MADISON MATHEMATICS RESEARCH CENTER
Personal Author(s) : Shrikhande,S. S.
Report Date : JUL 1967
Pagination or Media Count : 26
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)
Descriptors : (*COMBINATORIAL ANALYSIS, THEOREMS), GRAPHICS, MATRICES(MATHEMATICS), INEQUALITIES, NUMERICAL METHODS AND PROCEDURES
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE