Loading...
Loading...

Go to the content (press return)

Rainbow connectivity of Moore cages of girth 6

Author
Balbuena, C.; Fresán, J.; González, D.; Olsen, M.
Type of activity
Journal article
Journal
Discrete applied mathematics
Date of publication
2018-12-11
Volume
250
First page
104
Last page
109
DOI
https://doi.org/10.1016/j.dam.2018.04.020 Open in new window
Project funding
Optimization techniques in graph theory, groups, and combinatorics. Applications to networks, algorithms, and communication protocols
Repository
http://hdl.handle.net/2117/123591 Open in new window
URL
https://www.sciencedirect.com/science/article/pii/S0166218X18302403 Open in new window
Abstract
Let be an edge-colored graph. A path of is said to be rainbow if no two edges of have the same color. An edge-coloring of is a rainbow-coloring if for any two distinct vertices and of there are at least internally vertex-disjoint rainbow -paths. The rainbow-connectivity of a graph is the minimum integer such that there exists a rainbow -coloring using colors. A -cage is a -regular graph of girth and minimum number of vertices denoted . In this paper we focus on . It is known that and when the -c...
Citation
Balbuena, C., Fresán, J., González, D., Olsen, M. Rainbow connectivity of Moore cages of girth 6. "Discrete applied mathematics", 11 Desembre 2018, vol. 250, p. 104-109.
Keywords
Cages, Rainbow coloring, Rainbow connectivity
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants