Zobrazeno 1 - 3
of 3
pro vyhledávání: '"姚星辰"'
Autor:
Sing-Chen Yao, 姚星辰
101
Let T1,T2,...,Tk be spanning trees in a graph G. If, for any two vertices u,v of G, the paths joining u and v on the k trees are mutually vertex-disjoint, then T1,T2,...,Tk are called completely independent spanning trees in G. The construct
Let T1,T2,...,Tk be spanning trees in a graph G. If, for any two vertices u,v of G, the paths joining u and v on the k trees are mutually vertex-disjoint, then T1,T2,...,Tk are called completely independent spanning trees in G. The construct
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/66628288254938285812
Publikováno v:
Tianjin Medical Journal; Nov2021, Vol. 49 Issue 11, p1175-1178, 4p
Publikováno v:
Shandong Medical Journal; 12/5/2019, Vol. 59 Issue 34, p5-9, 5p