Locating Chromatic Number of Powers of Paths and Cycles

Let c be a proper k-coloring of a graph G. Let π = { R 1 , R 2 , … , R k } be the partition of V ( G ) induced by c, where R i is the partition class receiving color i. The color code c π ( v ) of a vertex v of G is the ordered k-tup...

Full description

Bibliographic Details
Main Authors: Manal Ghanem, Hasan Al-Ezeh, Ala’a Dabbour
Format: Article
Language:English
Published: MDPI AG 2019-03-01
Series:Symmetry
Subjects:
Online Access:http://www.mdpi.com/2073-8994/11/3/389