On The De…ning Number For Vertex Colorings Of A Family Of Graphs
Sadegh Rahimi Sharebaf, Nader Jafari Rad · 2011
In a given graph G = (V;E) a set S of vertices with an assignment of colors to them is called a de…ning set for vertex colorings of G if there exists a unique extension of S to a c � �(G) coloring of the vertices of G. A de…ning set with minimum cardinality is called a minimum de…ning set, and its cardinality is the de…ning number. In this paper, we study the de…ning number for vertex colorings of graphs arising from applying Mycielski’s construction to Ladder graphs.