Rainbow connections of bioriented graphs
For a directed graph D, it's deemed rainbow connected if each arc is assigned a different color, so that all paths from the vertex u to the vertex v are rainbow connected. Rainbow connection number refers to how many colors are needed in D to achieve rainbow connectivity. Among ordered vertex pair (...
Guardat en:
| Autors principals: | , , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Elsevier
2024-05-01
|
| Col·lecció: | Heliyon |
| Matèries: | |
| Accés en línia: | http://www.sciencedirect.com/science/article/pii/S2405844024074577 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|