부산대학교 도서관

A total labeling [xi] is defined to be an edge irregular total absolute difference k-labeling of the graph G if for every two different edges e and f of G there is wt(e) [not equal to] wt(f) where weight of an edge e = xy is defined as wt(e) = |[xi](e) - [xi](x) - [xi](y)|. The minimum k for which the graph G has an edge irregular total absolute difference labeling is called the total absolute difference edge irregularity strength of the graph G, tades(G). In this paper, we determine the total absolute difference edge irregularity strength of the precise values for some families of graphs. Keywords: Edge irregularity strength, total absolute difference edge irregularity strength, double fan, quadrilateral snake. AMS Subject Classification: 05C78.
1. INTRODUCTION Throughout this paper we consider only finite undirected graphs without loops or multiple edges. Chartrand et al. in [2] introduced edge k-labeling of a graph G such that [...]