• RAINBOW TOTAL CONNECTION NUMBER OF SOME WHEEL RELATED GRAPHS

JONAH GAY V. PEDRAZA*, MICHAEL P. BALDADO JR.

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.


Keywords


total-colored graph; rainbow total-connection number; sunflower graph; lotus inside circle.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2019 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter