3 citations · 4 across the 4 of their papers we have counts for
4 papers
A new approach for computing the distance and the diameter in circulant graphs
Laila Loudiki, Mustapha Kchikech, El Hassan Essaky
The diameter of a graph is the maximum distance among all pairs of vertices. Thus a graph has diameter if any two vertices are at distance at most and there are two ver…
Diameter formulas for a class of undirected multi-loop networks
Laila Loudiki, Mustapha Kchikech, El Hassan Essaky
Let and be positive integers. Let be a sequence of integers such that $1 \leq s_1 < s_2 < \ldots < s_m \leq \lfloor \frac{n-1}{2…
-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 -Labeling of the Mycielski and the iterated Mycielski of graphs in general. For a graph and all , we give sharp bounds for $λ(M^t(…
Diameter of generalized Petersen graphs
Laila Loudiki, Mustapha Kchikech, El Hassan Essaky
Due to their broad application to different fields of theory and practice, generalized Petersen graphs have been extensively investigated. Despite the regularity of gene…