文章基本信息

标题：On certain regular graphs of girth <mml:math alttext="$5$" xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mn>5</mml:mn></mml:math>
本地全文：下载
作者：M. O'keefe ; P. K. Wong
期刊名称：International Journal of Mathematics and Mathematical Sciences
印刷版ISSN：0161-1712
电子版ISSN：1687-0425
出版年度：1984
卷号：7
DOI：10.1155/S0161171284000806
出版社：Hindawi Publishing Corporation
摘要：Let f(v,5) be the number of vertices of a (v,5)-cage (v≥3). We give an upper bound for f(v,5) which is considerably better than the previously known upper bounds. In particular, when v=7, it coincides with the well-known Hoffman- Singleton graph.