Abstract
We consider the problem of construction of graphs with given degree $k$
and girth 5 and as few vertices as possible. We give a construction of a family
of girth 5 graphs based on relative difference sets. This family contains the
smallest known graph of degree 8 and girth 5 which was constructed by Royle,
four of the known cages including the Hoffman-Singleton graph, some graphs
constructed by Exoo and some new smallest known graphs.
Udgivelsesdato: APR 6
Udgivelsesdato: APR 6
| Originalsprog | Engelsk |
|---|---|
| Tidsskrift | Discrete Mathematics |
| Vol/bind | 293 |
| Udgave nummer | 1-3 |
| Sider (fra-til) | 177-184 |
| ISSN | 0012-365X |
| Status | Udgivet - 2005 |
Emneord
- Cayley graph
Fingeraftryk
Dyk ned i forskningsemnerne om 'Girth 5 graphs from relative difference sets'. Sammen danner de et unikt fingeraftryk.Citationsformater
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver