On Locating Chromatic Number Of Cubic Graph With Tree Cycle, C_(n,2n,n) for 6≤n≤10

Salde Ofera, Des Welyyanti

Abstract


Let G=(V,E) be a connected graph and c be a proper k-coloring of G Let  be the partition of induced by coloring c. The color code   of a vertex v in is where  for  If any two distinct vertex u,v in G satisfy that   then c is called a locating k-coloring of G. The locating-chromatic of G, denoted by . In this paper, we study the locating coloring of graph cubic  for .

Keywords : Locating Chromatic Number, Color Code,Cubic.


Keywords


Locating Chromatic Number, Color Code,Cubic.

Full Text:

PDF

References


Asmiati, H. Assiyatun , E.T. Baskoro, D. 2011. Locating-Chromatic Number of Amalgamation of Stars, ITB J.Sci, Vol 43 A, No 1, 1-8.

Asmiati, H. Assiyatun , E.T. Baskoro, D. Suprijanto, R. Simanjuntak and S. Uttunggadewa. 2012. The Locating-Chromatic Number of Firecracker, Far East Journal of Matematical Scinces, Vol 63, Number 1, 11-23.

Bondy, J.A. and U.S.R. Murty. 1976. Graph Theory with Applications. Elsevier Science Publishing Co.,Inc.,New York.

Chartrand, G., Zhang, P., dan Salehi, E. 1998. On the partition dimension of graph. Congr. Number: 157-168.

Chartrand, G., Erwin, D., Henning, M.A., Slater, P.J. dan Zhang, P. 2003.

Graph of Order n With Locating-Chromatic Numbern-1. Discrete Math. 269:65-79.

Chartrand, G., Salehi, E., dan Zhang, P.2000. The Partition Dimension of a Graph. Aequationes Mathematicae.59:45-54.

Welyyanti D, Baskoro E.T, Simanjuntak R., anmd Uttunggadewa S. 2015. On Locating-Chromatic Number of Graphs with Dominat Vertex, Procedia Computer Science. 74:89-92.




DOI: http://dx.doi.org/10.52155/ijpsat.v25.2.2906

Refbacks

  • There are currently no refbacks.


Copyright (c) 2021 Salde Ofera, Des Welyyanti

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License.