| Popis: |
The layout of the processors and links are represented a network structure in a distributed computer system. A graph is regarded as the topological structure of an interconnection network as usual, vertices and edges stand for processors and links between them, respectively. The internally disjoint Steiner trees of graphs are used in information engineering design and telecommunication networks. The \(\ell \)-set tree connectivity (also is called generalized \(\ell \)-connectivity), as an extension of the traditional connectivity, can provide for measuring the capability of connection arbitrary \(\ell \) vertices in a network. The folded Petersen cube networks \(FPQ_{n,k}\) have good properties and can be modeled the topological structure of a massively parallel processing system. This article shows the 3-set tree connectivity of \(FPQ_{n,k}\) is \(n+3k-1\). |
