Skip to Main content Skip to Navigation
Journal articles

Edge coloring total k-labeling of Generalized Peterson Graphs

Riadh Khennoufa Hamida Seba 1 Hamamache Kheddouci 1
1 GrAMA - Graphes, Algorithmes et Multi-Agents
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Équipe Gestionnaire Des Publications Si Liris <>
Submitted on : Wednesday, June 29, 2016 - 3:47:40 PM
Last modification on : Wednesday, July 8, 2020 - 12:43:33 PM


  • HAL Id : hal-01339172, version 1


Riadh Khennoufa, Hamida Seba, Hamamache Kheddouci. Edge coloring total k-labeling of Generalized Peterson Graphs. Information Processing Letters, Elsevier, 2013, 13, 113, pp.489-494. ⟨hal-01339172⟩



Record views