4 citations · 16 across the 12 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
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 has diameter if any two vertices are at distance at most 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 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…
math.PR2022
Backward Stochastic Evolution Inclusions in UMD Banach Spaces
E. H. Essaky, M. Hassani, C. E. Rhazlane
In this paper, we prove the existence of a mild -solution for the backward stochastic evolution inclusion (BSEI for short) of the form \begin{align*}%\label{BSDI3} \begin{case…