Loading...
Loading...

Go to the content (press return)

Elliptic semiplanes and regular graphs with girth 5

Author
Abajo, E.; Balbuena, C.; Bendala, M.
Type of activity
Journal article
Journal
Electronic notes in discrete mathematics
Date of publication
2018-07-01
Volume
68
First page
245
Last page
250
DOI
10.1016/j.endm.2018.06.042
Project funding
Optimization techniques in graph theory, groups, and combinatorics. Applications to networks, algorithms, and communication protocols
URL
https://www.sciencedirect.com/science/article/pii/S1571065318301331 Open in new window
Abstract
A (k, g)-graph is a k-regular graph with girth g and a (k, g)-cage is a (k, g)-graph with the fewest possible number of vertices. The cage problem consists of constructing (k, g)-graphs of minimum order n(k, g). We focus on girth , where cages are known only for degrees . Considering the relationship between finite geometries and graphs we establish upper constructive bounds on n(k, 5), for that improve the best so far known.
Keywords
Regular graphs, amalgam, cage, girth
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants