Bilangan Kromatik Lokasi Graf Tentakel
DOI:
https://doi.org/10.12962/limits.v22i2.3462Keywords:
Tentacle graph, locating-chromatic number, color code, color class, locating coloringAbstract
The locating-chromatic number of a graph was introduced by Chartrand et al. in 2002, which is a combined concept between the vertex coloring and partition dimension of a graph. The locating-chromatic number of a graph is a grouping of vertices on a graph based on color, which is called a color class, provided that each vertex on the graph has a different color code. Determining the locating-chromatic number of a graph is done by constructing the lower and upper bound of the locating-chromatic number of the graph. In this paper, we determine the locating-chromatic number of the tentacle graph, which is denoted by T_(k,m,n). Tentacle Graph is a graph constructed from a triangular book graph Bt_n whose common edge is amalgamated with C_k. Then two vertices in C_k that are adjacent to the vertex associated with the terminal edge are amalgamated with the star graphs S_(n_1) and S_(n_2). By determining the lower and upper bounds of the location chromatic number, it is obtained that the location chromatic number of Tentacle Graph is 4, m=1,n=2, n+1, for m>=1, n>= m + 2, and m + 2, for m > 1, n < m + 2.
Downloads
References
P. Z. Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, “The Locating-Chromatic Number of a Graph,” Bull. ICA, vol. 36, pp. 89–101, 2002.
A. Behtoei and B. Omoomi, “On the locating chromatic number of the cartesian product of graphs,” Ars Comb., vol. 126, pp. 221–235, 2016.
Asmiati and E. T. Baskoro, “Characterizing all graphs containing cycles with locating-chromatic number 3,” AIP Conf. Proc., vol. 1450, no. 3, pp. 351–357, 2012, doi: 10.1063/1.4724167.
E. T. Baskoro and A. Asmiati, “Characterizing all trees with locating-chromatic number 3,” Electron. J. Graph Theory Appl., vol. 1, no. 2, pp. 109–117, 2013, doi: 10.5614/ejgta.2013.1.2.4.
Asmiati, I. K. Sadha Gunce Yana, and L. Yulianti, “On the Locating Chromatic Number of Certain Barbell Graphs,” Int. J. Math. Math. Sci., vol. 2018, pp. 1–6, 2018, doi: 10.1155/2018/5327504.
D. Welyyanti, E. T. Baskoro, R. Simanjuntak, and S. Uttunggadewa, “The locating-chromatic number of disconnected graphs,” Far East J. Math. Sci., vol. 94, no. 2, pp. 169–182, 2014.
D. Welyyanti, E. T. Baskoro, R. Simanjuntak, and S. Uttunggadewa, “On Locating-chromatic Number for Graphs with Dominant Vertices,” Procedia Comput. Sci., vol. 74, pp. 89–92, 2015, doi: 10.1016/j.procs.2015.12.081.
