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

• المؤلفون الرئيسيون: Orgasan, Jude Ezekiel M., Tacub, Carmela Joy C.
• التنسيق: text
• اللغة: English
• منشور في: Animo Repository 2016
• الموضوعات: Graph theory, Colors > Analysis; Mathematics
• الوصول للمادة أونلاين: https://animorepository.dlsu.edu.ph/etd_bachelors/14918
• المؤسسة: De La Salle University

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...