Laila Loudiki

most citedA new approach for computing the distance and the diameter in circulant graphs

3 citations · 4 across the 3 of their papers we have counts for

collaborators

3 papers

math.CO2022★ 3 cited

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 $G$ has diameter $d$ if any two vertices are at distance at most $d$ and there are two ver…

math.CO2022★ 1 cited

Diameter formulas for a class of undirected multi-loop networks

Laila Loudiki, Mustapha Kchikech, El Hassan Essaky

Let $n \geq 5$ and $m \geq 1$ be positive integers. Let $S = (s_{1}, s_{2}, \dots, s_{m})$ be a sequence of integers such that $1 \leq s_1 < s_2 < \ldots < s_m \leq \lfloor \frac{n-1}{2…

math.CO2021

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 $GP G (n, s)$ have been extensively investigated. Despite the regularity of gene…