The construction of vertex-disjoint paths (disjoint paths) is an important research topic in various kinds of interconnection networks, which can improve the transmission rate and reliability. The -ary -cube is a family of popular networks. In this paper, we determine that there are disjoint paths in 3-ary -cube covering from to (many-to-many) with and from to (one-to-many) with where is in a fault-free cycle of length three.

中文翻译：

---

具有错误顶点的3-Ary-Cube中的顶点不相交路径

顶点不相交路径（不相交路径）的构建是各种互连网络中的重要研究课题，可以提高传输速率和可靠性。本-元-立方体是流行的网络一族。在本文中，我们确定3进制的不相交路径-覆盖从到（多对多）的立方和从到（一到多）与其中是在长度为三的无故障的周期。