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. (c) 2005 Elsevier B.V. All rights reserved.
机构:
SW Jiaotong Univ, Sch Math, Chengdu 610031, Peoples R China
Chinese Acad Sci, State Key Lab Informat Secur, Inst Software, Beijing, Peoples R ChinaSW Jiaotong Univ, Sch Math, Chengdu 610031, Peoples R China
Zhou, Zhengchun
Tang, Xiaohu
论文数: 0引用数: 0
h-index: 0
机构:
SW Jiaotong Univ, Provincial Key Lab Informat Coding & Transmiss, Chengdu 610031, Peoples R ChinaSW Jiaotong Univ, Sch Math, Chengdu 610031, Peoples R China
机构:
Univ Warwick, Math Inst, Coventry CV4 7AL, W Midlands, England
Univ Warwick, DIMAP, Coventry CV4 7AL, W Midlands, EnglandUniv Warwick, Math Inst, Coventry CV4 7AL, W Midlands, England
Csoka, Endre
Gerencser, Balazs
论文数: 0引用数: 0
h-index: 0
机构:
Hungarian Acad Sci, Alfred Renyi Inst Math, H-1051 Budapest, HungaryUniv Warwick, Math Inst, Coventry CV4 7AL, W Midlands, England
Gerencser, Balazs
Harangi, Viktor
论文数: 0引用数: 0
h-index: 0
机构:
Univ Toronto, Dept Math, Toronto, ON M5S 1A1, CanadaUniv Warwick, Math Inst, Coventry CV4 7AL, W Midlands, England
Harangi, Viktor
Virag, Balint
论文数: 0引用数: 0
h-index: 0
机构:
Univ Toronto, Dept Math, Toronto, ON M5S 1A1, CanadaUniv Warwick, Math Inst, Coventry CV4 7AL, W Midlands, England