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):

Report Date:

1967-07-01

Pagination or Media Count:

26.0

Abstract:

Necessary conditions for existence of partially balanced incomplete block designs with non-L sub 24 and non-T8 association schemes are derived. These are based on the facts that the non-L sub 24 scheme is Seidel-equivalent to the L sub 24 scheme and the three non-T8 schemes are Seidel-equivalent to the T8. 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

Subject Categories:

  • Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE