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...
保存先:
| 第一著者: | |
|---|---|
| フォーマット: | Artigo |
| 言語: | Inglês |
| 出版事項: |
UIN Syarif Hidayatullah
2023-06-01
|
| シリーズ: | InPrime |
| 主題: | |
| オンライン･アクセス: | https://journal.uinjkt.ac.id/index.php/inprime/article/view/29133 |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|