On the rainbow connection numbers of line, middle, and total graphs of wheels
<pre><span>An edge-colored graph </span><span class="math inline"><em>G</em></span><span> is called rainbow connected if any two vertices in </span><span class="math inline"><em>G</em></span><span> are connected by a path whose no two edges are colored the same. The rainbow connection of </span><spa...
Spremljeno u:
| Glavni autori: | , , |
|---|---|
| Format: | Artigo |
| Jezik: | Inglês |
| Izdano: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2025-04-01
|
| Serija: | Electronic Journal of Graph Theory and Applications |
| Teme: | |
| Online pristup: | http://www.ejgta.org/index.php/ejgta/article/view/1488 |
| Oznake: |
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|