Independent spanning trees on twisted cubes
From MaRDI portal
Recommendations
- Constructing independent spanning trees for locally twisted cubes
- A parallel algorithm for constructing independent spanning trees in twisted cubes
- Constructing edge-disjoint spanning trees in twisted cubes
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- Independent spanning trees in crossed cubes
Cites work
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Constructing edge-disjoint spanning trees in twisted cubes
- Constructing independent spanning trees for locally twisted cubes
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Efficient unicast in bijective connection networks with the restricted faulty node set
- Embedding a family of meshes into twisted cubes
- Embedding of cycles in twisted cubes with edge-pancyclic
- Embedding of tori and grids into twisted cubes
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
- Fault-tolerant Hamiltonicity of twisted cubes
- Finding Four Independent Trees
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Hamiltonian properties of twisted hypercube-like networks with more faulty elements
- scientific article; zbMATH DE number 1262807 (Why is no real title available?)
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- Independent spanning trees with small depths in iterated line digraphs
- Independent trees in graphs
- Independent trees in planar graphs
- On independent spanning trees
- Optimal fault-tolerant embedding of paths in twisted cubes
- Optimum broadcasting and personalized communication in hypercubes
- Reliable broadcasting in product networks
- The locally twisted cubes
- The multi-tree approach to reliability in distributed networks
- Three tree-paths
- Topological properties of twisted cube
Cited in
(26)- 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\)
- Improving the diameters of completely independent spanning trees in locally twisted cubes
- An algorithm to construct independent spanning trees on parity cubes
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
- An improved algorithm to construct edge-independent spanning trees in augmented cubes
- Construction independent spanning trees on locally twisted cubes in parallel
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes
- Constructing edge-disjoint spanning trees in twisted cubes
- Changing the diameter of the locally twisted cube
- Independent spanning trees on folded hyper-stars
- Constructing two completely independent spanning trees in hypercube-variant networks
- A comment on ``Independent spanning trees in crossed cubes
- Construction of optimal independent spanning trees on folded hypercubes
- Constructing node-independent spanning trees in augmented cubes
- A parallel algorithm for constructing independent spanning trees in twisted cubes
- Vertex-fault-tolerant cycles embedding in balanced hypercubes
- Edge-independent spanning trees in augmented cubes
- Constructing independent spanning trees for locally twisted cubes
- Independent spanning trees on even networks
- Independent spanning trees in crossed cubes
- Edge-independent spanning trees in folded crossed cubes
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- The orbits of twisted cubes
- Hybrid diagnosability based on g-extra fault pattern under the HPMC* model
This page was built for publication: Independent spanning trees on twisted cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q663434)
