Kamal Dliou

collaborators

2 papers

math.CO2021

A study of a combination of distance domination and resolvability in graphs

Dwi Agustin Retnowardani, Muhammad Imam Utoyo, Dafik +2

For $k \geq 1$ , in a graph $G = (V, E)$ , a set of vertices $D$ is a distance $k$ -dominating set of $G$ , if any vertex in $V ∖ D$ is at distance at most $k$ from some vertex in…

math.CO2021

$L (2, 1)$ -Labeling of the iterated Mycielski of graphs and some related to matching problems

Kamal Dliou, Hicham El Boujaoui, Mustapha Kchikech

In this paper, we study the $L (2, 1)$ -Labeling of the Mycielski and the iterated Mycielski of graphs in general. For a graph $G$ and all $t \geq 1$ , we give sharp bounds for $λ(M^t(…

A study of a combination of distance domination and resolvability in graphs

L(2,1)-Labeling of the iterated Mycielski of graphs and some related to matching problems

$L (2, 1)$ -Labeling of the iterated Mycielski of graphs and some related to matching problems