The Johnson graph J(d, r) is unique if (d, r) ≠ (2, 8)

The Johnson graph J(d, r) is unique if (d, r) ≠ (2, 8)

Paul Terwilliger
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
58
Year:
1986
Language:
english
Pages:
15
DOI:
10.1016/0012-365x(86)90160-3
File:
PDF, 740 KB
english, 1986
Conversion to is in progress
Conversion to is failed