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 (...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Elsevier
2024-05-01
|
| Colecção: | Heliyon |
| Assuntos: | |
| Acesso em linha: | http://www.sciencedirect.com/science/article/pii/S2405844024074577 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|