Constructing edge-disjoint spanning trees in twisted cubes

DOI10.1016/j.ins.2010.05.041zbMath1209.68387OpenAlexW2000868378MaRDI QIDQ2638205

Ming-Chien Yang

Publication date: 15 September 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.05.041

zbMATH Keywords

algorithmsinterconnection networksindependent spanning treesfault-toleranceedge-disjoint spanning treestwisted cubesdata broadcasting

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (14)

An algorithm to construct independent spanning trees on parity cubes ⋮ Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs ⋮ Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes ⋮ Independent spanning trees on twisted cubes ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ Fault-tolerant embedding of meshes/tori in twisted cubes ⋮ A parallel algorithm for constructing independent spanning trees in twisted cubes ⋮ The generalized 4-connectivity of hypercubes ⋮ Embedding meshes into twisted-cubes ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes ⋮ Independent spanning trees in crossed cubes ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes ⋮ Independent spanning trees in crossed cubes

Cites Work

• Independent spanning trees of chordal rings
• Fault-tolerant Hamiltonicity of twisted cubes
• Optimal fault-tolerant embedding of paths in twisted cubes
• Embedding of cycles in twisted cubes with edge-pancyclic
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Conditional edge-fault Hamiltonicity of augmented cubes
• Edge-fault-tolerant node-pancyclicity of twisted cubes
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• 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
• Arrangement graphs: A class of generalized star graphs
• Independent trees in planar graphs
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• Topological properties of twisted cube
• Constructing the nearly shortest path in crossed cubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Edge-disjoint spanning trees for the generalized butterfly networks and their applications
• Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• Independent Spanning Trees on Multidimensional Torus Networks
• Optimum broadcasting and personalized communication in hypercubes
• Finding Four Independent Trees

This page was built for publication: Constructing edge-disjoint spanning trees in twisted cubes