On the Equality of the Grundy Numbers of a Graph

Abstract : Our work becomes integrated into the general problem of the stability of the network ad hoc. Some, works attacked(affected) this problem. Among these works, we find the modelling of the network ad hoc in the form of a graph. Thus the problem of stability of the network ad hoc which corresponds to a problem of allocation of frequency amounts to a problem of allocation of colors in the vertex of graph. we present use a parameter of coloring " the number of Grundy”. The Grundy number of a graph G, denoted by Γ(G), is the largest k such that G has a greedy k-coloring, that is a coloring with colours obtained by applying the greedy algorithm according to some ordering of the vertices of G. In this paper, we study the Grundy number of the lexicographic, Cartesian and direct products of two graphs in terms of the Grundy numbers of these graphs.
Type de document :
Article dans une revue
International Journal of Next-Generation Networks, 2013, 5 (4), pp.13. 〈10.5121/ijngn.2013.5402〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01114420
Contributeur : Ali Mansouri <>
Soumis le : lundi 9 février 2015 - 13:54:48
Dernière modification le : mardi 10 février 2015 - 15:18:44

Identifiants

Citation

Ali Mansouri, Mohamed Salim Bouhlel. On the Equality of the Grundy Numbers of a Graph. International Journal of Next-Generation Networks, 2013, 5 (4), pp.13. 〈10.5121/ijngn.2013.5402〉. 〈hal-01114420〉

Partager

Métriques

Consultations de la notice

23