Bilangan Kromatik Lokasi Graf kubik C_(n,2n,2n,n) untuk n=3
DOI:
https://doi.org/10.55606/jurrimipa.v4i3.7515Keywords:
Color Code, Cubic Graph C_(n,2n,2n,n), Graph Theory, Location Chromatic Number, Location ColoringAbstract
Let G=(V(G),E(G)) be a connected graph and c be a coloring of the graph G. Let ∏={S_1,S_2,...,S_k }, where S_i is the class of colors in G which is colored i with 1≤i≤k. The representation of v with respect to Π is called a color code, denoted c_Π (v) is a k-element ordered pair, that is, c_∏ (v)=(d(v,S_1 ),d(v,S_2 ),...,d(v,S_k )), where d(v,S_i )=min{d(v,x)∣x ϵ S_i } for 1≤i≤k. If each vertex in G has a different color code then c is called a location coloring. The minimum number of colors used in the location coloring of a graph G is called the Location chromatic number with
Downloads
References
Asmiati, Baskoro, E. T., Assiyatun, H., & Simanjuntak, R. (2018). The locating-chromatic number of certain graphs. Journal of Mathematical and Fundamental Sciences, 50(3), 257–268. https://doi.org/10.5614/j.math.fund.sci.2018.50.3.5
Baskoro, E. T., & Darmaji. (2013). On the locating-chromatic number of graphs. Procedia Computer Science, 74, 57–60. https://doi.org/10.1016/j.procs.2015.12.133
Bondy, J. A., & Murty, U. S. R. (2008). Graph theory. Springer. https://doi.org/10.1007/978-1-84628-970-5
Bondy, J. A., & Murty, U. S. R. (2008). Graph theory. Springer. https://doi.org/10.1007/978-1-84628-970-5
Bondy, J. A., & Murty, U. S. R. (2018). Graph theory with applications. Springer.
Chartrand, G., & Zhang, P. (2012). A first course in graph theory. Dover Publications.
Chartrand, G., Erwin, D., Henning, M. A., Slater, P. J., & Zhang, P. (2002). The locating-chromatic number of a graph. Bulletin of the Institute of Combinatorics and Its Applications, 36, 89–101.
Chartrand, G., Erwin, D., Henning, M. A., Slater, P. J., & Zhang, P. (2003). Graphs of order n with locating-chromatic number n − 1. Discrete Mathematics, 269(1–3), 65–79. https://doi.org/10.1016/S0012-365X(02)00829-4
Chartrand, G., Erwin, D., Henning, M. A., Slater, P. J., & Zhang, P. (2003). Graphs of order n with locating-chromatic number n − 1. Discrete Mathematics, 269(1–3), 65–79. https://doi.org/10.1016/S0012-365X(02)00705-5
Chartrand, G., Salehi, E., & Zhang, P. (1998). The partition dimension of a graph. Aequationes Mathematicae, 55(1–2), 45–54. https://doi.org/10.1007/s000100050029
Chartrand, G., Salehi, E., & Zhang, P. (2000). The partition dimension of a graph. Aequationes Mathematicae, 59(1), 45–54. https://doi.org/10.1007/PL00000127
Chartrand, G., Zhang, P., Salehi, E., & Alikhani, S. (2002). The locating-chromatic number of a graph. Bulletin of the Institute of Combinatorics and Its Applications, 36, 89–101.
Sugesti, S., dkk. (2019). Bilangan kromatik lokasi graf kubik Cn,C2nCₙ, C₂ₙCn,C2n untuk n = 3 (Skripsi sarjana tidak dipublikasikan). Universitas Andalas, Indonesia.
West, D. B. (2001). Introduction to graph theory (2nd ed.). Prentice Hall.
Yero, I. G., & Rodríguez-Velázquez, J. A. (2013). A survey on the locating-chromatic number of a graph. Discrete Mathematics Letters, 1, 1–8.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 JURNAL RISET RUMPUN MATEMATIKA DAN ILMU PENGETAHUAN ALAM
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
