Independent Spanning Trees on Multidimensional Torus Networks
From MaRDI portal
Cited in
(19)- An algorithm to construct independent spanning trees on parity cubes
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
- Structural properties of subdivided-line graphs
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
- An improved algorithm to construct edge-independent spanning trees in augmented cubes
- Linear time algorithms for finding independent spanning trees on pyramid networks
- Construction independent spanning trees on locally twisted cubes in parallel
- Constructing edge-disjoint spanning trees in twisted cubes
- Independent spanning trees on folded hyper-stars
- An approach to conditional diagnosability analysis under the PMC model and its application to torus networks
- Completely independent spanning trees in torus networks
- Construction of optimal independent spanning trees on folded hypercubes
- Constructing node-independent spanning trees in augmented cubes
- Independent spanning trees on even networks
- Independent spanning trees in crossed cubes
- Independent spanning trees in crossed cubes
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- Panconnectivity and edge-pancyclicity of multidimensional torus networks
This page was built for publication: Independent Spanning Trees on Multidimensional Torus Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280831)