The Strong 3-Rainbow Index of Graphs Containing Three Cycles
Abstract The concept of a strong k-rainbow index is a generalization of a strong rainbow connection number, which has an interesting application in security systems in a communication network. Let G be an edge-colored connected graph of order n, where adjacent edges may be colored the same. A rainbo...
Uloženo v:
| Hlavní autor: | |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
UIN Syarif Hidayatullah
2023-06-01
|
| Edice: | InPrime |
| Témata: | |
| On-line přístup: | https://journal.uinjkt.ac.id/index.php/inprime/article/view/29133 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|