Independent spanning trees in crossed cubes
From MaRDI portal
Publication:5971214
DOI10.1016/j.ins.2013.01.010zbMath1284.68450OpenAlexW2052882295WikidataQ60402302 ScholiaQ60402302MaRDI QIDQ5971214
Shukui Zhang, Baolei Cheng, Jianxi Fan, Xiao-Hua Jia
Publication date: 16 April 2014
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2013.01.010
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (14)
Construction independent spanning trees on locally twisted cubes in parallel ⋮ A comment on ``Independent spanning trees in crossed cubes ⋮ Complete binary trees embeddings in Möbius cubes ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ A fast parallel algorithm for constructing independent spanning trees on parity cubes ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ Constructing completely independent spanning trees in crossed cubes ⋮ Edge-independent spanning trees in augmented cubes ⋮ Three completely independent spanning trees of crossed cubes with application to secure-protection routing ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Linear time algorithms for finding independent spanning trees on pyramid networks ⋮ A two-stages tree-searching algorithm for finding three completely independent spanning trees ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
Cites Work
- Connectivity of the crossed cube
- Independent spanning trees of chordal rings
- Constructing independent spanning trees for locally twisted cubes
- Independent spanning trees on even networks
- Independent spanning trees on twisted cubes
- Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
- Embedding of cycles in twisted cubes with edge-pancyclic
- Constructing edge-disjoint spanning trees in locally twisted cubes
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
- The multi-tree approach to reliability in distributed networks
- Independent trees in planar graphs
- Independent trees in graphs
- Topological properties of the crossed cube architecture
- Reliable broadcasting in product networks
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Constructing edge-disjoint spanning trees in twisted cubes
- Independent spanning trees on folded hyper-stars
- Three tree-paths
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Disjoint Rooted Spanning Trees with Small Depths in deBruijn and Kautz Graphs
- Embedding binary trees into crossed cubes
- A LINEAR-TIME ALGORITHM TO FIND FOUR INDEPENDENT SPANNING TREES IN FOUR CONNECTED PLANAR GRAPHS
- Independent Spanning Trees on Multidimensional Torus Networks
- Finding Four Independent Trees
This page was built for publication: Independent spanning trees in crossed cubes
