New families of small regular graphs of girth 5

preprint2015arXivOpen access

Abstract

In this paper we are interested in the {\it{Cage Problem}} that consists in constructing regular graphs of given girth gg and minimum order. We focus on girth g=5g=5, where cages are known only for degrees k≤7k \le 7. We construct regular graphs of girth 55 using techniques exposed by Funk [Note di Matematica. 29 suppl.1, (2009) 91 - 114] and Abreu et al. [Discrete Math. 312 (2012), 2832 - 2842] to obtain the best upper bounds known hitherto. The tables given in the introduction show the improvements obtained with our results.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.