On the Non-Existence of a Type of Regular Graphs of Girth 5
1967 ◽
Vol 19
◽
pp. 644-648
◽
ƒ(k, 5) is defined to be the smallest integer n for which there exists a regular graph of valency k and girth 5, having n vertices. In (3) it was shown that1.1Hoffman and Singleton proved in (4) that equality holds in the lower bound of (1.1) only for k = 2, 3, 7, and possibly 57. Robertson showed in (6) that ƒ(4, 5) = 19 and constructed the unique minimal graph.
1966 ◽
Vol 18
◽
pp. 1091-1094
◽
2010 ◽
Vol 83
(1)
◽
pp. 87-95
2008 ◽
Vol 17
(3)
◽
pp. 389-410
◽
Keyword(s):
Keyword(s):
Keyword(s):
1953 ◽
Vol 49
(1)
◽
pp. 59-62
◽
2015 ◽
Vol 91
(3)
◽
pp. 353-367
◽
2014 ◽
Vol 24
(4)
◽
pp. 658-679
◽
Keyword(s):