Results 211 to 220 of about 4,433,930 (229)

Completely Independent Spanning Trees in Maximal Planar Graphs

2002
Let G be a graph. Let T1, T2, . . . , Tk be spanning trees in G. If for any two vertices u, v in G, the paths from u to v in T1, T2, . . . , Tk are pairwise openly disjoint, then we say that T1, T2, . . . , Tk are completely independent spanning trees in G.
openaire   +2 more sources

Toward the completely independent spanning trees problem on BCube

2017 IEEE 9th International Conference on Communication Software and Networks (ICCSN), 2017
Completely independent spanning trees (CISTs) are important construct which can be used in data center networks for multi-node broadcasting, one-to-all broadcasting, reliable broadcasting, and secure message distribution, etc. As a recently proposed server-centric data center network, BCube has many good properties.
Ting Pan, Baolei Cheng, Jianxi Fan, Cheng-Kuan Lin, Dongfang Zhou   +4 more
openaire   +1 more source

The completely independent spanning trees in \(P_4\)-free graphs

Discret. Appl. Math.
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Yuan 0001, Jiya Hao, Aixia Liu, Shan Liu, Shuchang Chai, Shangwei Lin   +5 more
openaire   +2 more sources

Improving the diameters of completely independent spanning trees in locally twisted cubes

Information Processing Letters, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kung-Jui Pai, Jou-Ming Chang
openaire   +3 more sources

Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes

2019
For the underlying graph G of a network, k spanning trees of G are called completely independent spanning trees (CISTs for short) if they are mutually inner-node-disjoint. It has been known that determining the existence of k CISTs in a graph is an NP-hard problem, even for \(k=2\).
Kung-Jui Pai, Ruay-Shiung Chang, Jou-Ming Chang, Ro-Yu Wu   +3 more
openaire   +2 more sources

Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees

2016
Completely independent spanning trees \(T_1,T_2,\ldots ,T_k\) in a graph G are spanning trees in G such that for any pair of distinct vertices u and v, the k paths in the spanning trees between u and v mutually have no common edge and no common vertex except for u and v.
openaire   +1 more source

Completely Independent Spanning Trees in the Line Graphs of Torus Networks

2022
Qingrong Bian, Baolei Cheng, Jianxi Fan, Zhiyong Pan   +3 more
openaire   +2 more sources

Dirac's Condition for Completely Independent Spanning Trees

Journal of Graph Theory, 2014
Toru Araki
exaly  

Fan-Type Condition for Two Completely Independent Spanning Trees

Theoretical Computer Science
Jie Ma, Junqing Cai
openaire   +1 more source

Completely independent spanning trees in the line graph of complete multipartite graphs

Theoretical Computer Science
Hao Wang 0264, Yan Wang 0078, Baolei Cheng, Jianxi Fan   +3 more
openaire   +1 more source