1 citations · 1 across the 3 of their papers we have counts for
3 papers
cs.DM2014
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…
cs.DM2014
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…
math.CO2014★ 1 cited
On The Equality Of The Grundy Numbers Of A Graph
Ali Mansouri, Mohamed Salim Bouhlel
Our work becomes integrated into the general problem of the stability of the network ad hoc. Some, works attacked this problem. Among these works, we find the modelling of the netw…