Independent Spanning Trees on Multidimensional Torus Networks

[摘要]：Two spanning trees rooted at vertex r in a graph G are called independent spanning trees (ISTs) if for each vertex nu in G, nu not equal r, the paths from vertex nu to vertex r in these two trees are internally distinct. If the connectivity of G is k, the

[全文传递流程]：

一般上传文献全文的时限在1个工作日内