Girth 5 graphs from relative difference sets

Leif Kjær Jørgensen

Publikation: Bog/antologi/afhandling/rapportRapportForskning

19 Citationer (Scopus)
671 Downloads (Pure)

Abstract

We consider the problem of construction of graphs with given degree 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 G. Royle, four of the known cages including the Hoffman-Singleton graph, some graphs constructed by G. Exoo and some new smallest known graphs. k
OriginalsprogEngelsk
UdgivelsesstedDept. of Mathematical Sciences
ForlagAalborg Universitetsforlag
Antal sider11
StatusUdgivet - 2005
NavnResearch Report Series
NummerR-2005-05
ISSN1399-2503

Fingeraftryk

Dyk ned i forskningsemnerne om 'Girth 5 graphs from relative difference sets'. Sammen danner de et unikt fingeraftryk.

Citationsformater