Rainbow connections of bioriented graphs

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.

Keywords

• Bioriented graph
• Rainbow connection number
• Total rainbow connection number