On certain regular graphs of girth 5

M. O'keefe and P. K. Wong

International Journal of Mathematics and Mathematical Sciences, 1984, vol. 7, 1-7

Abstract:

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.

Date: 1984
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/7/738919.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/7/738919.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:738919

DOI: 10.1155/S0161171284000806

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().