Loading...
Loading...

Go to the content (press return)

Improving bounds on the order of regular graphs of girth 5

Author
Abajo, E.; Balbuena, C.; Bendala, M.; Marcote, F.
Type of activity
Journal article
Journal
Discrete mathematics
Date of publication
2019-10
Volume
342
Number
10
First page
2900
Last page
2910
DOI
10.1016/j.disc.2019.02.007
URL
https://www.sciencedirect.com/science/article/abs/pii/S0012365X19300627 Open in new window
Abstract
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...
Keywords
Amalgam, Cage, Elliptic semiplane, Girth, Small regular graphs
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants