9 citations · 12 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
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…
The result for the grundy number on p4 classes
Ali Mansouri, Mohamed Salim bouhlel
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…