Abstract
A (k,g)-cage is a k-regular graph of girth g of minimum order. In this work, we focus on girth g=5, where cages are known only for degrees k≤7. When k≥8, except perhaps for k=57, the order of a (k,5)-cage is strictly greater than 1+k2. Considering the relationship between finite geometries and graphs we establish upper constructive bounds that improve the best so far.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.