Results 1 to 10 of about 4,808,150 (201)

Completely Independent Spanning Trees in (Partial) k-Trees [PDF]

open access: yesDiscussiones Mathematicae Graph Theory, 2015
Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint.
Matsushita Masayoshi   +2 more
doaj   +3 more sources

Completely Independent Spanning Trees in k-Th Power of Graphs [PDF]

open access: yesDiscussiones Mathematicae Graph Theory, 2018
Let T1, T2, . . . , Tk be spanning trees of a graph G. For any two vertices u, v of G, if the paths from u to v in these k trees are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent. Araki showed that the square of
Hong Xia
doaj   +2 more sources

Construction Algorithm of Completely Independent Spanning Tree in Dragonfly Network [PDF]

open access: yesJisuanji kexue, 2022
Dragonfly network,proposed by Kim et al.,is a topology for high-performance computer systems.In dragonfly network,compute nodes are attached to switches,the switches are organized into groups,and the network is organized as a two-level clique.There is a ...
BIAN Qing-rong, CHENG Bao-lei, FAN Jian-xi, PAN Zhi-yong
doaj   +1 more source

Home - About - Disclaimer - Privacy