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 (...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
Elsevier
2024-05-01
|
| Saila: | Heliyon |
| Gaiak: | |
| Sarrera elektronikoa: | http://www.sciencedirect.com/science/article/pii/S2405844024074577 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|