Edge coloring total k-labeling of Generalized Peterson Graphs
Résumé
The Edge-coloring total k-labeling of a connected graph G is an assignmentf of non negative integers to the vertices and edges of G such thattwo adjacent edges uv and uv′ of G have different weights. The weightof an edge uv is defined by: w(uv) = f(u) + f(v) + f(uv). In this paper,we study the chromatic number of the edge coloring total k-labeling ofgeneralized peterson graphs and we propose exact values.