Constructing completely independent spanning trees in crossed cubes
From MaRDI portal
Publication:505430
DOI10.1016/j.dam.2016.11.019zbMath1354.05026OpenAlexW2567500060MaRDI QIDQ505430
Jianxi Fan, Baolei Cheng, Da-Jin Wang
Publication date: 23 January 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.11.019
Related Items (17)
How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ Embedding complete multi-partite graphs into Cartesian product of paths and cycles ⋮ Constructing two completely independent spanning trees in hypercube-variant networks ⋮ A Hamilton sufficient condition for completely independent spanning tree ⋮ Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees ⋮ Cycles embedding in balanced hypercubes with faulty edges and vertices ⋮ Constructing dual-CISTs of folded divide-and-swap cubes ⋮ Reliability analysis based on the dual-CIST in shuffle-cubes ⋮ A well-equalized 3-CIST partition of alternating group graphs ⋮ Constructing dual-CISTs of DCell data center networks ⋮ Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Constructing tri-CISTs in shuffle-cubes ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Degree conditions for completely independent spanning trees of bipartite graphs ⋮ Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\)
Cites Work
- Unnamed Item
- Unnamed Item
- Paired many-to-many disjoint path covers in restricted hypercube-like graphs
- Ore's condition for completely independent spanning trees
- Two counterexamples on completely independent spanning trees
- A fast fault-identification algorithm for bijective connection graphs using the PMC model
- Completely independent spanning trees in some regular graphs
- Constructing independent spanning trees for locally twisted cubes
- Efficient unicast in bijective connection networks with the restricted faulty node set
- A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
- Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
- Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Fault-tolerant cycle-embedding of crossed cubes
- Embedding a family of disjoint 3D meshes into a crossed cube
- The multi-tree approach to reliability in distributed networks
- Embedding meshes into crossed cubes
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
- Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
- Embedding binary trees into crossed cubes
- Completely independent spanning trees in torus networks
- Completely independent spanning trees in the underlying graph of a line digraph
- Independent spanning trees in crossed cubes
This page was built for publication: Constructing completely independent spanning trees in crossed cubes
