Edge-independent spanning trees in augmented cubes
DOI10.1016/J.TCS.2017.01.016zbMATH Open1359.68234OpenAlexW2580783993MaRDI QIDQ515545FDOQ515545
Authors: Yan Wang, Hong Shen, Jianxi Fan 
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- The super connectivity of augmented cubes
- The multi-tree approach to reliability in distributed networks
- On edge-disjoint spanning trees in hypercubes
- An algorithm to construct independent spanning trees on parity cubes
- Independent trees in planar graphs
- Augmented cubes
- Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
- A comment on ``Independent spanning trees in crossed cubes
- Independent spanning trees in crossed cubes
- Independent spanning trees on twisted cubes
- Independent spanning trees on even networks
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
- Reliable broadcasting in product networks
- A fast parallel algorithm for constructing independent spanning trees on parity cubes
- Edge-disjoint spanning trees on the star network with applications to fault tolerance
Cited In (11)
- A comment on ``Independent spanning trees in crossed cubes
- Edge-disjoint paths in faulty augmented cubes
- Edge-independent spanning trees in folded crossed cubes
- How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
- The 4-set tree connectivity of hierarchical folded hypercube
- Constructing edge-disjoint spanning trees in locally twisted cubes
- An improved algorithm to construct edge-independent spanning trees in augmented cubes
- Improving the diameters of completely independent spanning trees in locally twisted cubes
- On edge-disjoint spanning trees in hypercubes
- Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
- Constructing Node-Independent Spanning Trees in Augmented Cubes
This page was built for publication: Edge-independent spanning trees in augmented cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515545)
