Rainbow connection number on amalgamation of tadpole graphs and amalgamation of sun graphs

In graph theory, graph coloring is a special case of graph labeling. One of graph coloring is rainbow connection. A path in the graph is called a rainbow path if none of the edges are the same color. A graph is said to be rainbow connection if it contains a rainbow path for each pair of vertices. The smallest number that represents the number of rainbow colors on the edges is called a rainbow connection number. In this article, we determine rainbow connection number of amalgamation of tadpole graphs and amalgamation of sun graphs.