On the spectrum for K_{m+2}/K_m designs
Data(s) |
01/01/1997
|
---|---|
Resumo |
The spectrum problem for the decomposition of K-n into copies of the graph K_{m+2}\K_m is solved for n = 0 or 1 (mod 2m + 1). (C) 1997 John Wiley & Sons, Inc. |
Identificador | |
Idioma(s) |
eng |
Palavras-Chave | #Mathematics |
Tipo |
Journal Article |