Improving bounds on the order of regular graphs of girth 5
Rights accessOpen Access
A -graph is a -regular graph with girth and a -cage is a -graph with the fewest possible number of vertices . Constructing -cages and determining the order are both very hard problems. For this reason, an intensive line of research is devoted to constructing smaller -graphs than previously known ones, providing in this way new upper bounds to each time such a graph is constructed. The paper focuses on girth , where cages are known only for degrees . We construct -graphs using and extending techniques of amalgamation into the incidence graphs of elliptic semiplanes of type introduced and exposed by Funk (2009). The order of these graphs provides better upper bounds on than those known so far, for values of such that either or.
© 2019. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/
CitationAbajo, E. [et al.]. Improving bounds on the order of regular graphs of girth 5. "Discrete mathematics", 1 Octubre 2019, vol. 342, núm. 10, p. 2900-2910.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder