Rainbow connection number of comb product of graphs
<p><span>An edge-colored graph </span><span class="math inline"><em>G</em></span><span> is called a rainbow connected if any two vertices are connected by a path whose edges have distinct colors. Such a path is called a rainbow path. The smallest number of colors required in order to make </span><sp...
Uloženo v:
| Hlavní autoři: | , , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2022-09-01
|
| Edice: | Electronic Journal of Graph Theory and Applications |
| Témata: | |
| On-line přístup: | http://www.ejgta.org/index.php/ejgta/article/view/1225 |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|