Rainbow and strong rainbow connection number for some families of graphs
Abstract: Let G be a nontrivial connected graph. Then G is called a rainbow connected graph if there exists a coloring c : E(G) → {1, 2, ..., k}, k ∈ N, of the edges of G, such that there is a u − v rainbow path between every two vertices of G, where a path P in G is a...
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Langue: | English |
| Publié: |
Universidad Católica del Norte, Departamento de Matemáticas
2020
|
| Sujets: | |
| Accès en ligne: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0716-09172020000400737 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|