Local strong rainbow connection number of corona product between cycle graphs
<p style="text-align: justify;">A rainbow geodesic is a shortest path between two vertices where all edges are colored differently. An edge coloring in which any pair of vertices with distance up to <em>d</em>, where <em>d</em> is a positive integer that can be connected by a rainbow geodesic is cal...
Tallennettuna:
| Päätekijät: | , |
|---|---|
| Aineistotyyppi: | Artigo |
| Kieli: | Inglês |
| Julkaistu: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2023-07-01
|
| Sarja: | Indonesian Journal of Combinatorics |
| Aiheet: | |
| Linkit: | http://www.ijc.or.id/index.php/ijc/article/view/183 |
| Tagit: |
Ei tageja, Lisää ensimmäinen tagi!
|