A report on small regular bipartite graphs is given. Some historical facts are mentioned as well as equivalent combinatorial structures are discussed. In the second part a new combinatorial structure, the (v,k, even/odd)-designs are introduced. Some first results on (v,k, even)-designs for even k ar
On (v, k, λ) graphs and designs with trivial automorphism group
✍ Scribed by F.C Bussemaker; W.H Haemers; J.J Seidel; E Spence
- Publisher
- Elsevier Science
- Year
- 1989
- Tongue
- English
- Weight
- 633 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract For a positive integer __n__ and a finite group __G__, let the symbols __e__(__G, n__) and __E__(__G, n__) denote, respectively, the smallest and the greatest number of lines among all __n__‐point graphs with automorphism group __G__. We say that the Intermediate Value Theorem (IVT) hol
This study tested the hypothesis that high-dose peginterferon alfa-2a (PEG-IFNalpha-2a) for the first 12 weeks would increase early and sustained virological response (SVR) rates in patients with chronic hepatitis C genotype 1. Eight hundred ninety-six patients were randomized 1:1 to 360 microg (n =