Edge coloring total k-labeling of Generalized Peterson Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Information Processing Letters Année : 2013

Edge coloring total k-labeling of Generalized Peterson Graphs

Riadh Khennoufa
  • Fonction : Auteur
Hamida Seba

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.
Fichier non déposé

Dates et versions

hal-01339172 , version 1 (29-06-2016)

Identifiants

  • HAL Id : hal-01339172 , version 1

Citer

Riadh Khennoufa, Hamida Seba, Hamamache Kheddouci. Edge coloring total k-labeling of Generalized Peterson Graphs. Information Processing Letters, 2013, 13, 113, pp.489-494. ⟨hal-01339172⟩
59 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More