具有任意多个最小距离图的三环网络
Triple-loop networks with arbitrarily many minimum distance diagrams
摘要：
最小距离图是一种编码多环网络直径和路由信息的方法。对于广泛研究的双环网络的情况，已知每个网络最多有两个这样的图，并且它们具有非常确定的形式“L形”。与此相反，在本文中，我们表明，有一个任意大的数量相关联的最小距离图的三环网络。为此，我们建立了最小距离图和单项理想之间的关系。
英文摘要：
Minimum distance diagrams are a way to encode the diameter and routing information of multi-loop networks. For the widely studied case of double-loop networks, it is known that each network has at most two such diagrams and that they have a very definite form "L-shape''. In contrast, in this paper we show that there are triple-loop networks with an arbitrarily big number of associated minimum distance diagrams. For doing this, we build-up on the relations between minimum distance diagrams and monomial ideals.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
