Project Details
Description
We want to find the largest possible bipartite graphs with maximum degree k and diameter D, for given numbers k and D. The Moore bound is an obvious upper bound on the number of vertices. We consider graphs where the number of vertices is the Moore bound minus 2. Probably, such graphs exist only in very few cases. We prove some non-existence results.
| Status | Finished |
|---|---|
| Effective start/end date | 01/01/2008 → 31/12/2010 |
Collaborative partners
- Federation University Australia (Project partner)
- Newcastle University (Project partner)
- Laboratoire de Recherche en Informatique (Project partner)
Funding
- <ingen navn>
Fingerprint
Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.