Edge-independent spanning trees in augmented cubes
From MaRDI portal
Publication:515545
DOI10.1016/J.TCS.2017.01.016zbMath1359.68234OpenAlexW2580783993MaRDI QIDQ515545
Jianxi Fan, Yan Wang, Hong Shen
Publication date: 16 March 2017
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2017.01.016
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 (6)
How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube? ⋮ Edge-disjoint paths in faulty augmented cubes ⋮ Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes ⋮ Edge-independent spanning trees in folded crossed cubes ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes
Cites Work
- A comment on ``Independent spanning trees in crossed cubes
- Independent spanning trees on even networks
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- Independent spanning trees on twisted cubes
- A fast parallel algorithm for constructing independent spanning trees on parity cubes
- The super connectivity of augmented cubes
- 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
- Reliable broadcasting in product networks
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
- On edge-disjoint spanning trees in hypercubes
- An algorithm to construct independent spanning trees on parity cubes
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
- Augmented cubes
- Independent spanning trees in crossed cubes
This page was built for publication: Edge-independent spanning trees in augmented cubes
