On Tades of Disjoint Union of Some Graphs

Abstract

Consider a total labeling ξ of a graph G . For every two different edges e and f of G , let w t ( e ) ≠ w t ( f ) where weight of e = x y is defined as w t ( e ) = | ξ ( e ) – ξ ( x ) – ξ ( y ) | . Then ξ is called edge irregular total absolute difference k -labeling of G . Let k be the minimum integer for which there is a graph G with edge irregular total absolute difference labeling. This k is called the total absolute difference edge irregularity strength of the graph G , denoted t a d e s ( G ) . We compute t a d e s of S C n , disjoint union of grid and zigzag graph.