The Vertex-Rainbow Connection Number of Some Graph Operations
A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rainbow) if no two edges (respectively internal vertices) of the path are colored the same. An edge-colored (respectively vertex-colored) graph G is rainbow connected (respectively vertex-rainbow connecte...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
University of Zielona Góra
2021-05-01
|
| Saila: | Discussiones Mathematicae Graph Theory |
| Gaiak: | |
| Sarrera elektronikoa: | https://doi.org/10.7151/dmgt.2206 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|