Rainbow Connection Number of Octopus Iteration Graphs
The rainbow connection number of a graph G denoted by rc(G) is the minimum number of colors used to color the edges in G, such that every pair of vertices is connected by a path with all different colors. In 2008, Chartrand et al. first introduced the concept of rainbow connection numbers. They int...
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
UIN Syarif Hidayatullah
2024-11-01
|
| Colección: | InPrime |
| Materias: | |
| Acceso en línea: | https://journal.uinjkt.ac.id/index.php/inprime/article/view/41414 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|