Results 141 to 150 of about 3,899,169 (179)

Completely Independent Spanning Trees in Some Regular Graphs

Discrete Applied Mathematics, 2017
Let $k\ge 2$ be an integer and $T_1,\ldots, T_k$ be spanning trees of a graph $G$. If for any pair of vertices $(u,v)$ of $V(G)$, the paths from $u$ to $v$ in each $T_i$, $1\le i\le k$, do not contain common edges and common vertices, except the vertices $u$ and $v$, then $T_1,\ldots, T_k$ are completely independent spanning trees in $G$.
Olivier Togni, Gastineau Nicolas, Benoit Darties   +2 more
exaly   +6 more sources

Some of the next articles are maybe not open access.

Related searches:

Independent Spanning Trees in Networks: A Survey

ACM Computing Surveys, 2023
The problem of constructing independent spanning trees (ISTs) dates back to as early as the late 1980s. Given a network G of a certain topology, the question is whether we can, as well as how to, construct a set of ISTs in G .
Baolei Cheng, Jianxi Fan, Dajin Wang
exaly   +3 more sources

Completely Independent Spanning Trees in Line Graphs

Graphs and Combinatorics, 2023
20 pages with 5 ...
Toru Hasunuma
exaly   +3 more sources

Independent spanning trees in crossed cubes

Information Processing Letters, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yan-Hong Zhang, Wei Hao, Tao Xiang 0001
  +8 more sources

Independent Spanning Trees on Twisted Cubes

Journal of Parallel and Distributed Computing, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaohua Jia, Jianxi Fan, Guodong Zhou
exaly   +2 more sources

Independent Spanning Trees on Even Networks

Information Sciences, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
László Lipták, Eddie Cheng, Hyeong-Ok Lee   +2 more
exaly   +3 more sources

Node-Independent Spanning Trees in Gaussian Networks [PDF]

Journal of Parallel and Distributed Computing, 2017
Message broadcasting in networks could be carried over spanning trees. A set of spanning trees in the same network is node independent if two conditions are satisfied. First, all trees are rooted at node $r$. Second, for every node $u$ in the network, all trees' paths from $r$ to $u$ are node-disjoint, excluding the end nodes $r$ and $u$.
Bader AlBdaiwi, Zaid Hussain, Anton Černý   +2 more
exaly   +4 more sources

On independent spanning trees

Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Samir Khuller, Baruch Schieber
openaire   +1 more source

Independent Spanning Trees in RTCC-Pyramids

The Computer Journal, 2016
The independent spanning trees (ISTs) problem is asked to find k spanning trees rooted at a designated vertex r such that, for any vertex v, all paths connecting r and v in k spanning trees are pairwise internally disjoint in the given graph. ISTs have numerous applications in networks such as reliable communication protocols, data broadcasting and ...
Wang, SI (Wang, Shuo-I), Wang, FH (Wang, Fu-Hsing)   +1 more
openaire   +1 more source

Degree Condition for Completely Independent Spanning Trees

Information Processing Letters, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qinghai Liu, Hong Xia
exaly   +2 more sources