DOI Number : 10.5614/itbj.sci.2011.43.1.1
Hits : 13

Locating-Chromatic Number of Amalgamation of Stars

Asmiati1, H.Assiyatun & E.T. Baskoro

1Combinatorial Mathematics Research Group
Jl. Ganesa 10 Bandung, Bandung 40132, Indonesia
Email :


Let G be a connected graph and c a proper coloring of G. For i=1,2,,k define the color class Ci as the set of vertices receiving  color i.  The color code  cP(v) of a vertex v in G is the ordered k-tuple (d(v,C1),,d(v,Ck)) where d(v,C1) is the distance of v to Ci.  If all distinct vertices of G have distinct color codes, then c is called a locating-coloring of G. The locating-chromatic number of graph G, denoted by cL(G) is the smallest k such that G has a locating coloring with k colors. In this paper we discuss the locating-chromatic number of  amalgamation of stars Sk,m. Sk,m is obtained from k copies of star K1,m by identifying a leaf from each star. We also determine a sufficient condition for a connected subgraph H Sk,m satisfying cL(H) ≤  cL(Sk,m).

Keywords: amalgamation of stars; color code; locating-chromatic number.

Download Article
Bahasa Indonesia | English


Begin on 10 October 2014 this website is no longer activated for article process in Journal of Mathematical and Fundamental Sciences, Journal of Engineering and Technological Sciences, Journal of ICT Research and Applications and Journal of Visual Art and Design. The next process will be proceeded under new website at

For detail information please contact us to:

       ITB Journal Visitor Number #14855042       
       Jl. Tamansari 64, Bandung 40116, Indonesia Visitor IP Address #       
       Tel : +62-22-250 1759 ext. 121 2011 Institut Teknologi Bandung       
       Fax : +62-22-250 4010, +62-22-251 1215 XHTML + CSS + RSS       
       E-mail : or Developed by AVE