Total Rainbow Connection Number Of Shackle Product Of Antiprism Graph ( ) Bilangan

Function if is said to be k total rainbows in , for each pair of vertex there is a path called with each edge and each vertex on the path will have a different color. The total connection number is denoted by trc defined as the minimum number of colors needed to make graph to be total rainbow connected. Total rainbow connection numbers can also be applied to graphs that are the result of operations. The denoted shackle graph is a graph resulting from the denoted graph where t is number of copies of G. This research discusses rainbow connection numbers rc and total rainbow connection trc(G) using the shackle operation, where is the antiprism graph . Based on this research, rainbow connection numbers rc shack , and total rainbow connection trc shack for .


INTRODUCTION
The development of science and technology to date continues to experience a significant increase.Scientists continue to research to always bring up discoveries that can contribute to science as support for the development of other sciences.One of them is mathematics that scientists discovered hundreds of years ago, which until now can make it easier for humans to solve existing problems.Mathematics is a field of science that can solve or solve problems in real life.One of the branches of mathematics that are often used as an auxiliary sense to describe a problem and theory that is known and widely known today is a graph.
Graph theory first appeared when Leonard Euler tried to solve the Konigsberg bridge problem in 1736.The Konigsberg Bridge is a bridge in an old city in East Prussia which is now commonly called Kalinigrad.Seven bridges were built over the Pregel river to allow residents of Konigsberg to walk from one town to another.Leonhard Euler solved this problem by modeling this problem into a graph [12].
In graph theory there is a topic that is labeling.Graph labeling consists of vertex labeling, edge labeling, and total labeling.One case of labeling is graph coloring.Graph coloring can be used for scheduling, cartography, sudoku, and traffic light settings [14].Graph coloring is a special case of graph labeling.Graph coloring has three types of coloring: vertex coloring, edge coloring, and region coloring.Spot color indicates the color of a single vertex, with a different color for each of the two adjacent vertex.The color of the side shows the color of the side where the two sides are next to each other and will be a different color.When coloring an area, one area is colored and adjacent areas have a different color [2].
One of the interesting research subjects in coloring on graphs is the rainbowconnection.An edge graph coloured is rainbow connected if every two vertices are connected by at least one rainbow path in G.For a connected graph G, the rainbow connection number of G, denoted by rc(G), is defined as the smallest number of colours required to make it rainbow connected [4].Who studies rainbow connected numbers [3] Proper Rainbow Connection Number of Graphs.Next [7] Rainbow Connected Numbers in Corona Operation Result Graphs Antiprism Graphs ( ) and Complete Graphs (K4).Rainbow connected number into total rainbow connected.Total rainbow connected is connected the vertices and edges so that each pair of vertices in the graph has a complete total rainbow path [12] Research on total rainbow connected numbers was first introduced by Uchizawa in 2011, defining k as a natural number.Function If is said to be a k-coloring -total rainbow on G, each pair of vertex has a path called x − y with each edge and each vertex on the path having a different color.Such a path is called the total rainbow path.A graph G is said to be total rainbow connected if for every pair of vertices there is a -total rainbow path .The total rainbow connected number is denoted by Defined as the minimum number of colors needed to make graph a total-connected rainbow.Next [1] examines the total rainbow connections by determining the lower and upper bounds for the total rainbow connections number in the amalgamated graph.[13].
Examining total rainbow connected numbers on line graphs and double line graphs of brush graphs.
Total rainbow connected numbers can also be applied to graphs that are the result of operations.The operation used in this research is shackle [5].Shackle or shackle denoted by shack is a graph resulting from t copies of graph G which is given the symbol (G, t) with and t natural numbers every with then and do not have the same vertex and for every , Gt and G(t + 1) have k − 1 such connecting vertex everything is different.If Gi is isomorphic to graph H, for shack the shackle of graph H is denoted shack [11].Therefore In this research, we will make rainbow connection number ( ) and total rainbow connection numbers for antiprism graphs with reference to relevant research, using the shackle operation of the graph, where .

Let be a positive integer and is a graph if then
Proof.Based on the theorem of Chartrand et al. (2008) it is known that if it is enough to show that there is a rainbow path with coloring.
Meanwhile, if or needs to be proven by contradiction.Therefore, to prove Theorem 2.1 it is necessary to show that there is a rainbow path because .
Given Next it will be shown that there is a rainbow path that Suppose then there is .Without compromising generality.For example in the Figure 2.1 the coloring is defined as follows: The coloring of the shackle operation results of the antiprism graph is shown in the Figure 2.1  Given Next it will be shown that there is a rainbow path that Suppose then there is .Without compromising generality.For example in the figure 2.2 the coloring is defined as follows: The coloring of the shackle operation results of the antiprism graph is shown in the Figure 2   Furthermore, it will be shown that for each and at vertex and there is a rainbow path with coloring in the following Table 2.2

CONCLUSION
The results of this research show that the Shackle operation result of the antiprism graph with .Rainbow connection numbers of shackle product of antiprism graph are obtained .And the total rainbow connection number of shackle product of antiprism graph are obtained .

Table 2 .1. Rainbow path C a s e X Y Condition Total Rainbow Path 1 JURNAL MATEMATIKA, STATISTIKA DAN KOMPUTASI Melisa Huntala, Muhammad Rezky F. Payu, Nisky Imansyah Yahya Theorem
2.2 it is necessary to show that there is a total rainbow path because .