Edge irregular mapping or vertex mapping h : V (U ) ?? {1, 2, 3, 4, ..., s} is a mapping of vertices in such a way that all edges have distinct weights. We evaluate weight of any edge by using equation wth(cd) = h(c)+h(d), ?c, d ? V (U ) and ?cd ? E(U ). Edge irregularity strength denoted by es(U ) is a minimum positive integer use to label vertices to form edge irregular labeling. In this paper, we find exact value of edge irregularity strength of different families of comb graph.