Results 1 to 10 of about 14,336 (100)
Completely Independent Spanning Trees in (Partial) k-Trees
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 +3 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 +2 more sources
Completely Independent Spanning Trees in k-Th Power of Graphs
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 +2 more sources
Completely Independent Spanning Trees in Line Graphs
Graphs and Combinatorics, 2023 20 pages with 5 ...
openaire +2 more sources
Ore’s condition for completely independent spanning trees
Discrete Applied Mathematics, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan, Genghua, Hong, Yanmei, Liu, Qinghai
openaire +2 more sources
Completely independent spanning trees in some Cartesian product graphs
AIMS Mathematics, 2023 <abstract><p>Let $ T_{1}, T_{2}, \dots, T_{k} $ 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 $ T_{1}, T_{2}, \dots, T_{k} $ are completely independent.
Xia Hong, Wei Feng
openaire +2 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 ...
Darties, Benoit +2 more
openaire +3 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$.
Darties, Benoit +2 more
openaire +3 more sources
On Completely Edge-Independent Spanning Trees in Locally Twisted Cubes
Fundamenta Informaticae, 2023 A network can contain numerous spanning trees. If two spanning trees T i , T j do not share any common edges, T i and
Li, Xiaorui +4 more
openaire +2 more sources
Constructing completely independent spanning trees in crossed cubes
Discrete Applied Mathematics, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, Baolei, Wang, Dajin, Fan, Jianxi
openaire +1 more source