Results 11 to 20 of about 3,899,169 (179)
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 +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
Parallel Construction of Edge-independent Spanning Trees in Augmented Cubes [PDF]
Jisuanji kexueIn recent years,more and more research work is being conducted around interconnected networks.Independent spanning trees(ISTs) can be used in reliable transmission,parallel transmission,safe distribution of information,and parallel diagnosis of fault ...
LI Xiajing, CHENG Baolei, FAN Jianxi, WANG Yan, LI Xiaorui
doaj +2 more sources
On Independent Spanning Trees in Random Graphs
A central challenge in network design is ensuring resilience: how can we guarantee multiple, independent, communication pathways between nodes, even when some connections fail in a network?
Nemanja Draganic +4 more
core +3 more sources
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
Four Edge-Independent Spanning Trees [PDF]
SIAM Journal on Discrete Mathematics, 2018 We prove an ear-decomposition theorem for 4-edge-connected graphs and use it to prove that for every 4-edge-connected graph $G$ and every $r\in V(G)$, there is a set of four spanning trees of $G$ with the following property. For every vertex in $G$, the unique paths back to $r$ in each tree are edge-disjoint.
Alexander Hoyer, Robin Thomas 0001
openaire +2 more sources
Completely Independent Spanning Trees in Line Graphs [PDF]
, 2022 Completely independent spanning trees in a graph $G$ are spanning trees of $G$ such that for any two distinct vertices of $G$, the paths between them in the spanning trees are pairwise edge-disjoint and internally vertex-disjoint.
Hasunuma, Toru
core +1 more source
Two Algorithms for Constructing Independent Spanning Trees in (
IEEE Access, 2020 In a graph $G$ , two spanning trees $T_{1}$ and $T_{2}$ are rooted at the same vertex $r$ . If, for every $v \in V(G)$ , the paths from $v$ to the root $r$ in $T_{1}$ and $T_{2}$ are internally vertex-disjoint, they are called independent ...
Jie-Fu Huang +2 more
doaj +1 more source