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 techn...
Abajo, 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.
DM-OrderRegularGirth5.pdf
(426112 bytes)
Share
