earticle

영어

In a (d, k)-graph problem, the Petersen graph has a maximum of 10 nodes at degree 3 and diameter 2. Using the Petersen graph, a folded Petersen cube network, a hyper-Petersen network, a cube-connected Petersen network, a cyclic Petersen network, a Petersen-torus network and a 3D Petersen-Torus network have been suggested. In an interconnection network, a disjoint path is an important research topic for efficient and reliable routing. In this study, a disjoint path on the Petersen graph was analyzed so that it could be applied to construction of a disjoint path in a network to be made using the Petersen graph or one to be developed in any other way. It was demonstrated that three-node disjoint paths can be constructed between any two nodes (one-to-one), and that node disjoint paths can be constructed between any one node and any three nodes (one-to-many). The maximum nodes disjoint path in the Petersen graph is three. The length of every disjoint path was not greater than the Petersen graph diameter plus two, and node disjoint paths were edge-disjointed.