On the locating-chromatic number of some classes of graphs and graphs obtained from graph operations

Let G = (V E) be a graph. Let c be a proper k-coloring of a connected graph G and = fC1 C2 : : : Cng be an ordered partition of V (G) induced from the coloring c resulting into color classes. For a vertex v 2 V (G), the color code of v with respect to is de ned as the ordered k-tuple c (v) = (d(v C1...

全面介紹

Saved in:
書目詳細資料
Main Authors: Orgasan, Jude Ezekiel M., Tacub, Carmela Joy C.
格式: text
語言:English
出版: Animo Repository 2016
主題:
在線閱讀:https://animorepository.dlsu.edu.ph/etd_bachelors/14918
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!