Figure Continuity And Non-regular Strength

A network G(w) is a graph G in which each edge is assigned integer weight. The label of a vertex in G(w) is the sum of the weight of its incident edges. A network is irregular if distinct vertices have distinct labels. The irregularity sum E (G) of the graph G is the minimum sum of vertex labels among all irregular networks having G as an underlying graph.A garph G for wich ∑(G)=nδ+(n2) is called consecutive. Michael S.Jacobson etc. proved several classes of graph are consecutive and determined their ∑ (G). KM. Kathiresan determined ∑ (G) for special ladder, books and fans. In this paper, we mainly study consecution of consecutive graph under several operations. Also we determine bounds of irregularity strength and ∑(G) for there classes of graphs.