2 citations · 2 across the 2 of their papers we have counts for
6 papers
On the Broadcast Independence Number of Circulant Graphs
Abdelamin Laouar, Isma Bouchemakh, Eric Sopena
An independent broadcast on a graph is a function such that for every vertex , where $\operat…
Broadcasts on Paths and Cycles
Sabrina Bouchouika, Isma Bouchemakh, Eric Sopena
A broadcast on a graph is a function such that for every vertex , where$\operatorname…
On the Broadcast Independence Number of Locally Uniform 2-Lobsters
Messaouda Ahmane, Isma Bouchemakh, Eric Sopena
Let be a simple undirected graph.A broadcast on isa function such that holds for every vertex of , where denotes…
Trees with unique minimum glolal offensive alliance sets
Mohamed Bouzefrane, Isma Bouchemakh, Mohamed Zamime +1
Let be a simple graph.\ A non-empty set is called a global offensive alliance if is a dominating set and for every vertex in …
2-Distance Colorings of Integer Distance Graphs
Brahim Benmedjdoub, Eric Sopena, Isma Bouchemakh
A 2-distance k-coloring of a graph G is a mapping from V (G) to the set of colors {1,. .. , k} such that every two vertices at distance at most 2 receive distinct colors. The 2-dis…
Packing coloring of some undirected and oriented coronae graphs
Laïche Daouya, Isma Bouchemakh, Eric Sopena
The packing chromatic number $\pcn(G)$ of a graph is the smallest integer such that its set of vertices can be partitioned into disjoint subsets , \ldots,…