9 citations · 9 across the 5 of their papers we have counts for
5 papers
Algorithmes dynamiques pour la communication dans le réseau ad hoc Coloration des graphes
Ali Mansouri, Mohamed Salim Bouhlel
Several authors modelled networks ad hoc by oriented or disoriented graphs, whereby the problem of allowance (allocation) of the frequencies at the level of the network was transfo…
A linear algorithm for the grundy number of a tree
Ali Mansouri, Mohamed Salim Bouhlel
A coloring of a graph G = (V,E) is a partition {V1, V2, . . ., Vk} of V into independent sets or color classes. A vertex v Vi is a Grundy vertex if it is adjacent to at least one v…
Coloration de nombre de Grundy pour les graphes triangulés
Ali Mansouri, Mohamed Salim bouhlel
The problem of the data routing management, it provides a method or a strategy that guarantees at any time the connection between any pair of nodes in the network. This routing met…
Results for grundy number of the complement of bipartite graphs
Ali Mansouri, Mohamed Salim Bouhlel
A Grundy k-coloring of a graph G, is a vertex k-coloring of G such that for each two colors i and j with i < j, every vertex of G colored by j has a neighbor with color i. The Grun…
Exact values for the Grundy number of some graphs
Ali Mansouri, Mohamed Salim Bouhlel
The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex x colored with color i, is adjace…