论文标题
一类无向多环网络的直径公式
Diameter formulas for a class of undirected multi-loop networks
论文作者
论文摘要
令$ n \ geq 5 $和$ m \ geq 1 $为正整数。令$ s =（s_1，s_2，\ ldots，s_m）$是一系列整数，以至于$ 1 \ leq s_1 <s_2 <s_2 <s_m \ s_m \ leq \ leq \ lfloor \ lfloor \ frac {n-1} $ c_n（s_1，s_2，\ ldots，s_m）$当$ s_1 = 1 $。我们还提出了多环网络直径与广义彼得森图的直径之间的关系。
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 networks $C_n(s_1,s_2, \ldots, s_m)$ when $s_1=1$. We also present a relation between the diameter of multi-loop networks and the diameter of generalized Petersen graphs.
