• RAINBOW TOTAL CONNECTION NUMBER OF SOME WHEEL RELATED GRAPHS

Abstract

A path P connecting two vertices u and v in a totally colored graph G is called a rainbow total-path between u and v if all elements in , except for u and v, are assigned distinct colors. A total-colored graph is rainbow total-connected if it has a rainbow total-path between every two vertices. The rainbow total-connection number of a graph G is the minimum colors such that G is rainbow total-connected. In this paper, we gave the rainbow total-connection number of sunflower graph and lotus inside circle graph.