Results 11 to 20 of about 3,644,794 (274)
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 +2 more sources
Completely independent spanning trees in the hypercube [PDF]
CoRR16 pages, 1 ...
Shaw, Benedict Randall
core +4 more sources
Contributions to Discrete MathematicsLet $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 spanning trees.
Xia Hong 0005, Feng Gao, Zengbao Wu
core +4 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 +5 more sources
Algorithm to Construct Node-independent Spanning Trees in Data Center Network BCDC [PDF]
Jisuanji kexue, 2022 As the foundation of cloud computing technology,the communication performance of data center networks has become a research hotspot in recent years.And as an important infrastructure of data center networks,independent spanning trees(ISTs) attract much ...
PAN Zhi-yong, CHENG Bao-lei, FAN Jian-xi, BIAN Qing-rong
doaj +1 more source
Independent spanning trees in Eisenstein–Jacobi networks [PDF]
The Journal of Supercomputing, 2022 Spanning trees are widely used in networks for broadcasting, fault-tolerance, and securely delivering messages. Hexagonal interconnection networks have a number of real life applications. Examples are cellular networks, computer graphics, and image processing. Eisenstein-Jacobi (EJ) networks are a generalization of hexagonal mesh topology.
Zaid A. Hussain +2 more
openaire +3 more sources
Constructive Heuristics for the Minimum Labelling Spanning Tree Problem: a preliminary comparison [PDF]
, 2006 This report studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible.
Moreno, J A +3 more
core +6 more sources
Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs
IEEE Access, 2021 The generalized recursive circulant networking can be widely used in the design and implementation of interconnection networks. It consists of a series of processors, each is connected through bidirectional, point-to-point communication channels to ...
Dun-Wei Cheng +2 more
doaj +1 more source
Four Edge-Independent Spanning Trees [PDF]
SIAM Journal on Discrete Mathematics, 2018 22 pages, 4 figures. Presented at the 29th Cumberland Conference on Combinatorics, Graph Theory and Computing at Vanderbilt ...
Alexander Hoyer, Robin Thomas 0001
openaire +2 more sources
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
IEEE Access, 2021 A set of the spanning trees in a graph $G$ is called independent spanning trees if they have a common root $r$ and for each vertex $v\in V(G)\setminus \{r\}$ , the paths from $v$ to $r$ in any two trees are directed edge-disjoint and internally ...
Yi-Cheng Yang +5 more
doaj +1 more source