Bilangan Kromatik Lokasi Amalgamasi Sisi Graf Lingkaran $amal_s(C_n^j;v_{j,1}v_{j,n})$ dengan $n=3,4$, dan $m\geq2$

Authors

  • Des Welyyanti Universitas Andalas
  • Romie Daramenra Universitas Andalas
  • Lyra Yulianti Universitas Andalas

DOI:

https://doi.org/10.12962/limits.v22i3.3470

Keywords:

Locating Chromatic Number, Circle Graph, Edge Amalgamation, Color Code, Partition

Abstract

Let G be a connected graph and {S_1,S_2,…,S_k} be an ordered partition of V(G). Let S_i is a set of color classes using colors 1,2,...,k where k as positive integer. The color code c_ (v) of vertex v in G with respect to  is defined as k-vector, c_ (v)=(d(v,S_1 ),d(v,S_2 ),…,d(v,S_i )) where d(v,S_i ). If each of vertices in G have distinct color codes, then c is called as locating coloring of G. The minimum number of colors that are used for locating coloring is called as locating chromatic number of G, denoted by X_L (G). 

Downloads

Download data is not yet available.

References

P. Z. G. Chartrand, D. Erwin, M. A. Henning, P. J. Slater, "The locating-chromatic number of a graph," Bull.Inst.Combin.Appl, vol. 36, pp. 8-101, 2002.

Asmiati, H. Assiyatun, and E. T. Baskoro, "Locating-chromatic number of amalgamation of stars," ITB J. Sci., vol. 43 A, no. 1, pp. 1-8, 2011, doi: 10.5614/itbj.sci.2011.43.1.1.

Asmiati, E. T. Baskoro, H. Assiyatun, D. Suprijanto, R. Simanjuntak, and S. Uttunggadewa, "The locating-chromatic number of firecracker graphs," Far East J. Math. Sci., vol. 63, no. 1, pp. 11-23, 2012.

Asmiati and E. T. Baskoro, "Characterizing all graphs containing cycles with locating-chromatic number 3," in AIP Conference Proceedings, 2012, pp. 351-357. doi: 10.1063/1.4724167.

D. Welyyanti, E. T. Baskoro, R. Simanjuntak, and S. Uttunggadewa, "On locating-chromatic number of complete n-ary tree," 2013.

D. Welyyanti, E. T. Baskoro, R. Simanjuntak, and S. Uttunggadewa, "On Locating-chromatic Number for Graphs with Dominant Vertices," in Procedia Computer Science, Elsevier B.V., 2015, pp. 89-92. doi: 10.1016/j.procs.2015.12.081.

A. Asmiati, L. Yulianti, and C. I. T. Widyastuti, "Further Results on Locating Chromatic Number for Amalgamation of Stars Linking by One Path," Indones. J. Comb., vol. 2, no. 1, p. 50, 2018, doi: 10.19184/ijc.2018.2.1.6.

F. Hartiansyah and D. Darmaji, "Bilangan Kromatik Lokasi pada Graf Hasil Amalgamasi Sisi dari Graf Bintang dan Graf Lengkap," Zeta-Math J., vol. 8, no. 2, pp. 66-70, Jul. 2023, doi: 10.31102/zeta.2023.8.2.66-70.

R. P. Soleha, "Bilangan Kromatik Lokasi dari Hasil Amalgamasi Graf Bintang yang Dihubungkan oleh Suatu Graf Lingkaran," J. Mat. UNAND, vol. IX, no. 1, pp. 46-52, 2020.

N. Andriani, "Bilangan Kromatik Lokasi Pada Graf Amalgamasi Kipas Berekor," Limits J. Math. Its Appl., vol. 20, no. 1, p. 81, 2023, doi: 10.12962/limits.v20i1.12948.

D. Welyyanti, D. Sutanto, and L. Yulianti, "Jurnal Natural," J. Nat., vol. 24, no. 2, pp. 115-127, 2024, doi: 10.24815/jn.v24i2.29356.

H. Iswadi, E. T. Baskoro, A. N. M. Salman, and R. Simanjuntak, "The Resolving Graph of Amalgamation of Cycles."

F. Abdmouleh, "Bulletin of the Title: LINEAR OPERATORS," vol. 40, no. 5, pp. 1057-1066, 2014

Downloads

Published

2025-11-20

How to Cite

Welyyanti, D. ., Daramenra, R. ., & Yulianti, L. . (2025). Bilangan Kromatik Lokasi Amalgamasi Sisi Graf Lingkaran $amal_s(C_n^j;v_{j,1}v_{j,n})$ dengan $n=3,4$, dan $m\geq2$. imits: ournal of athematics and ts pplications, 22(3), 153–165. https://doi.org/10.12962/limits.v22i3.3470