domination number and identifying code number of the subdivision graphs

Let g = (v, e) be a simple graph. a set c of vertices of 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 is denoted by γ id(g). in this paper, we prove that the identifying code number of the subdivision of a graph g of order n is at most n. also, we prove that the identifying code number of the subdivision of graphs kn, kr,s and cp (s) are n, r + s and 2s, respectively. finally, we conjecture that for every graph g of order n the identifying code number of the subdivision of g is n.