13 citations · 15 across the 5 of their papers we have counts for
10 papers
Broadcast independence number of oriented circulant graphs
Abdelamin Laouar, Isma Bouchemakh, Eric Sopena
In 2001, D. Erwin \cite{Erw01} introduced in his Ph.D. dissertation the notion of broadcast independence in unoriented graphs. Since then, some results but not many, are published…
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 …
Incidence Choosability of Graphs
Brahim Benmedjdoub, Isma Bouchemakh, Eric Sopena +1
An incidence of a graph G is a pair (v, e) where v is a vertex of G and e is an edge of G incident with v. Two incidences (v, e) and (w, f) of G are adjacent whenever (i) v = w, or…
On the Broadcast Independence Number of Caterpillars
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 …
Packing Coloring of Undirected and Oriented Generalized Theta Graphs
Daouya Laïche, Isma Bouchemakh, Eric Sopena
The packing chromatic number (G) of an undirected (resp. oriented) graph G is the smallest integer k such that its set of vertices V (G) can be partitioned into k disjoint…
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,…