Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

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 (19)

Construction independent spanning trees on locally twisted cubes in parallel ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ A comment on ``Independent spanning trees in crossed cubes ⋮ \(g\)-good-neighbor conditional diagnosability of star graph networks under PMC model and MM\(^*\) model ⋮ Edge-independent spanning trees in folded crossed cubes ⋮ Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs ⋮ Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes ⋮ A fast parallel algorithm for constructing independent spanning trees on parity cubes ⋮ Construction of optimal independent spanning trees on folded hypercubes ⋮ Constructing vertex-disjoint paths in \((n, k)\)-star graphs ⋮ A parallel algorithm for constructing independent spanning trees in twisted cubes ⋮ Edge-independent spanning trees in augmented cubes ⋮ The 2-good-neighbor connectivity and 2-good-neighbor diagnosability of bubble-sort star graph networks ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes ⋮ Independent spanning trees on folded hyper-stars ⋮ Independent spanning trees in crossed cubes ⋮ Fault tolerance in bubble-sort graph networks ⋮ Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks ⋮ A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks

Cites Work

This page was built for publication: Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security