Back to Search
Start Over
Rainbow connections of bioriented graphs
- Source :
- Heliyon, Vol 10, Iss 10, Pp e31426- (2024)
- Publication Year :
- 2024
- Publisher :
- Elsevier, 2024.
-
Abstract
- 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 (u,v) with arc coloring, if both arcs and internal vertices exhibit unique colors, it is referred to as a total colored graph. As the total rainbow connection number indicates, the smallest number of colors are required to total-color D. This paper focuses on investigating the rainbow connection number of the biorientation of a connected graph, as well as the total rainbow connection number.
Details
- Language :
- English
- ISSN :
- 24058440
- Volume :
- 10
- Issue :
- 10
- Database :
- Directory of Open Access Journals
- Journal :
- Heliyon
- Publication Type :
- Academic Journal
- Accession number :
- edsdoj.773ab9a84140b6a98f39b48a76c690
- Document Type :
- article
- Full Text :
- https://doi.org/10.1016/j.heliyon.2024.e31426