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.
Highlights
International Journal of Submit your manuscripts at http://www.hindawi.com
International Journal of Mathematics and Mathematical Sciences
Read more 
Summary
Introduction
Results
Conclusion
Sign-in/Register to view highlights & summary Full Text Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematics and Mathematical Sciences
Paper Title
Journal
Date
