the identifying code number and mycielski’s construction of graphs

Let g = (v, e) be a simple graph. a set c of vertices g is an identifying code of g if for every two vertices x and y the sets ng[x] ∩ c and ng[y] ∩ c are non-empty and different. given a graph g, the smallest size of an identifying code of g is called the identifying code number of g and denoted by γ^id(g). two vertices x and y are twins when ng[x] = ng[y]. graphs with at least two twin vertices are not an identifiable graph. in this paper, we deal with the identifying code number of mycielski’s construction of graph g. we prove that the mycielski’s construction of every graph g of order n ≥ 2, is an identifiable graph. also, we present two upper bounds for the identifying code number of mycielski’s construction g, such that these two bounds are sharp. finally, we show that foucaud et al.’s conjecture is holding for mycielski’s construction of some graphs.