| Abstrak/Abstract |
An edge irregular total k ? labeling on simple and undirected graph G(V, E) is a map
f : V ? E ?{1,2,..., k} such that for any different edges xy and x' y' their weights, i.e., f (x) ? f (xy) ? f ( y) and ) ' ( ) ' ' ( ) ' ( y f y x f x f ? ? are distinct. The minimum k for which the graph G has an edge irregular total labeling k ? is called the total edge irregularity strength of G and is denoted by ) (Gtes . In this paper, we determine the exact value of the total edge irregularity strength of book graphs ????????(????????) for ???? = 5,6,7,8,9,10 and obtained ????(????????(????????) = ?(?????1)????+3
3
? .
|
