Results 1 to 10 of about 4,433,930 (229)
Completely Independent Spanning Trees in (Partial) k-Trees [PDF]
Discussiones 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 +6 more sources
Completely Independent Spanning Trees in k-Th Power of Graphs [PDF]
Discussiones 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 +3 more sources
Almost disjoint spanning trees: Relaxing the conditions for completely independent spanning trees
Discrete Applied Mathematics, 2018 The search of spanning trees with interesting disjunction properties has led to the introduction of edge-disjoint spanning trees, independent spanning trees and more recently completely independent spanning trees. We group together these notions by defining (i, j)-disjoint spanning trees, where i (j, respectively) is the number of vertices (edges ...
Olivier Togni, Benoit Darties
exaly +7 more sources
Two counterexamples on completely independent spanning trees [PDF]
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Péterfalvi, Ferenc
exaly +5 more sources
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, Benoit Darties
exaly +6 more sources
Completely independent spanning trees in the underlying graph of a line digraph [PDF]
Discrete Mathematics, 2001 Trees \(T_1,\dots,T_k\) are completely independent spanning trees in a graph \(H\), if for any vertex \(r\) in \(H\) they are independent spanning trees rooted at \(r\). The paper gives a characterization of completely independent spanning trees. Further, it is shown that for any \(k\)-vertex-connected line digraph \(L(G)\), there are \(k\) completely ...
Toru Hasunuma
exaly +5 more sources
Completely Independent Spanning Trees in Line Graphs
Graphs and Combinatorics, 2023 20 pages with 5 ...
Toru Hasunuma
exaly +3 more sources
Ore’s condition for completely independent spanning trees
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Genghua Fan, Qinghai Liu, Yanmei Hong
exaly +4 more sources
Construction Algorithm of Completely Independent Spanning Tree in Dragonfly Network [PDF]
Jisuanji 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
A Note on the Degree Condition of Completely Independent Spanning Trees
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2015 Jou-Ming Chang, Jinn-Shyong Yang
exaly +2 more sources