Results 11 to 20 of about 7,242 (121)
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
Completely independent spanning trees in Eisenstein-Jacobi networks
The Journal of SupercomputingAbstract In this work, we propose construction algorithms to build Completely Independent Spanning Trees (CIST) in EJ networks with time complexity of $O(n)$, where $n$ is the total number of nodes in the network. We present a sequential and a parallel CISTs construction algorithms.
Zaid Hussain +2 more
openaire +1 more source
Two counterexamples on completely independent spanning trees
Discrete Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
An Algorithm to Construct Completely Independent Spanning Trees in Line Graphs
The Computer Journal, 2021 AbstractIn the past few years, much importance and attention have been attached to completely independent spanning trees (CISTs). Many results, such as edge-disjoint Hamilton cycles, traceability, number of spanning trees, structural properties, topological indices, etc., have been obtained on line graphs, and researchers have applied the line graphs ...
Yifeng Wang +4 more
openaire +1 more source
Fan's condition for completely independent spanning trees
Spanning trees $T_1,T_2, \dots,T_k$ of $G$ are $k$ completely independent spanning trees if, for any two vertices $u,v\in V(G)$, the paths from $u$ to $v$ in these $k$ trees are pairwise edge-disjoint and internal vertex-disjoint. Hasunuma proved that determining whether a graph contains $k$ completely independent spanning trees is NP-complete, even ...
Ma, Jie, Cai, Junqing
openaire +2 more sources
Constructing two completely independent spanning trees in hypercube-variant networks
Theoretical Computer Science, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kung-Jui Pai, Jou-Ming Chang
openaire +2 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.
openaire +1 more source
Construction of Four Completely Independent Spanning Trees on Augmented Cubes
, 2017 Let T1, T2,..., Tk be spanning trees in a graph G. If for any pair of vertices {u, v} of G, the paths between u and v in every Ti( 0 < i < k+1) do not contain common edges and common vertices, except the vertices u and v, then T1, T2,..., Tk are called completely independent spanning trees in G. The n-dimensional augmented cube, denoted as AQn, a
Mane, S. A. +2 more
openaire +2 more sources
Completely Independent Spanning Trees on Some Interconnection Networks
IEICE Transactions on Information and Systems, 2014 Kung-Jui PAI +4 more
openaire +2 more sources