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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
InaCombS; Universitas Jember; dan Universitas Indonesia
2023-07-01
|
| Series: | Indonesian Journal of Combinatorics |
| Subjects: | |
| Online Access: | http://www.ijc.or.id/index.php/ijc/article/view/183 |
| Tags: |
No Tags, Be the first to tag this record!
|