Results 81 to 90 of about 14,359 (120)
Some of the next articles are maybe not open access.
Degree condition for completely independent spanning trees
Information Processing Letters, 2016zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong, Xia, Liu, Qinghai
openaire +1 more source
Completely independent spanning trees in torus networks
Networks, 2011AbstractLet T1, T2, …, Tk be spanning trees in a graph G. If for any two vertices u, v in G, the paths from u to v in T1, T2, …, Tk are pairwise internally disjoint, then T1, T2, …, Tk are completely independent spanning trees in G. Completely independent spanning trees can be applied to fault‐tolerant communication problems in interconnection networks.
Hasunuma, Toru, Morisaka, Chie
openaire +2 more sources
Dirac's Condition for Completely Independent Spanning Trees
Journal of Graph Theory, 2013AbstractTwo 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. In this article, we show two sufficient conditions for the existence of completely independent spanning trees. First, we show that a graph of n vertices has two completely independent
openaire +1 more source
New comments on “A Hamilton sufficient condition for completely independent spanning tree”
Discrete Applied Mathematics, 2021zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Junjiang, Su, Guifu, Song, Guanbang
openaire +1 more source
Toward the completely independent spanning trees problem on BCube
2017 IEEE 9th International Conference on Communication Software and Networks (ICCSN), 2017Completely 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 +4 more
openaire +1 more source
Vertex-independent spanning trees in complete Josephus cubes
Theoretical Computer SciencezbMATH Open Web Interface contents unavailable due to conflicting licenses.
He, Qi +3 more
openaire +1 more source
Construction of Completely Independent Spanning Tree Based on Vertex Degree
2021Interconnection networks have been extensively studied in the field of parallel computer systems. In the interconnection network, completely independent spanning tree (CISTs) plays an important role in the reliable transmission, parallel transmission, and safe distribution of information. Two spanning trees \(T_1\) and \(T_2\) of graph G are completely
Ningning Liu, Yujie Zhang, Weibei Fan
openaire +1 more source
The Existence of Completely Independent Spanning Trees for Some Compound Graphs
IEEE Transactions on Parallel and Distributed Systems, 2020Given two regular graphs $G$ G and $H$ H such that the vertex degree of $G$ G is equal to the number of vertices in $H$ H , the compound graph $G(H)$ G ( H ) is constructed by replacing each vertex of $G$ G by a copy of $H$ H and replacing each edge of $G$ G by an ...
Xiao-Wen Qin +2 more
openaire +1 more source
2013
Let T 1, T 2,…, T k be spanning trees in a graph G. If for any two vertices x, y of G, the paths from x to y in T 1, T 2,…, T k are vertex-disjoint except end vertices x and y, then T 1, T 2,…, T k are called completely independent spanning trees in G. In 2001, Hasunuma gave a conjecture that there are k completely independent spanning trees in any 2k ...
Kung-Jui Pai +3 more
openaire +1 more source
Let T 1, T 2,…, T k be spanning trees in a graph G. If for any two vertices x, y of G, the paths from x to y in T 1, T 2,…, T k are vertex-disjoint except end vertices x and y, then T 1, T 2,…, T k are called completely independent spanning trees in G. In 2001, Hasunuma gave a conjecture that there are k completely independent spanning trees in any 2k ...
Kung-Jui Pai +3 more
openaire +1 more source
Completely Independent Spanning Trees in Maximal Planar Graphs
2002Let 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 +1 more source