Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Loudiki, Laila"'
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 vertices at distance $d$. We are interested in studying the diameter of c
Externí odkaz:
http://arxiv.org/abs/2210.11116
Let $n\geq 5$ and $m\geq 1$ be positive integers. Let $S = ( s_1, s_2, \ldots , s_m)$ be a sequence of integers such that $1 \leq s_1 < s_2 < \ldots < s_m \leq \lfloor \frac{n-1}{2} \rfloor.$ In this paper, we discuss the diameter of multi-loop netwo
Externí odkaz:
http://arxiv.org/abs/2209.13018
Due to their broad application to different fields of theory and practice, generalized Petersen graphs $GPG(n,s)$ have been extensively investigated. Despite the regularity of generalized Petersen graphs, determining an exact formula for the diameter
Externí odkaz:
http://arxiv.org/abs/2102.10397
Autor:
Loudiki, Laila1 (AUTHOR) m.kchikech@uca.ac.ma, Bidine, Ez-Zobair2 (AUTHOR) z.bidine@uhp.ac.ma, Kchikech, Mustapha1 (AUTHOR)
Publikováno v:
Symmetry (20738994). Dec2023, Vol. 15 Issue 12, p2160. 14p.
