Girth 5 graphs from relative difference sets

被引:15
|
作者
Jorgensen, LK [1 ]
机构
[1] Univ Aalborg, Dept Math Sci, DK-9220 Aalborg, Denmark
关键词
cage; girth; Cayley graph; relative difference set;
D O I
10.1016/j.disc.2004.08.029
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:177 / 184
页数:8
相关论文
共 50 条