The locating-chromatic number for Halin graphs

Let $G$ be a connected graph‎. ‎Let $f$ be a proper $k$-coloring of $G$ and $\Pi=\{R_1,R_2,\ldots‎, ‎R_k\}$ be an ordered partition of $V(G)$ into color classes‎. ‎For any vertex $v$ of $G,$ define the {\em color code} $c_\Pi(v)$ of $v$ with respect to $\Pi$ to be a $k$-tuple $(d(v,R_1),d(v,R_2),\ld...

Full description

Bibliographic Details
Main Authors: I.A‎. ‎Purwasih, ‎E.T‎. ‎Baskoro, H‎. ‎Assiyatun, ‎D‎. ‎Suprijanto, M‎. ‎Ba\v{c}a
Format: Article
Language:English
Published: Azarbaijan Shahide Madani University 2017-01-01
Series:Communications in Combinatorics and Optimization
Subjects:
Online Access:http://comb-opt.azaruniv.ac.ir/article_13577_2227.html