Edge-independent spanning trees in augmented cubes

DOI10.1016/J.TCS.2017.01.016MaRDI QIDQ515545zbMATHOpenAlexFDO

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

zbMATH Keywords

algorithmfault-toleranceaugmented cubesedge-independent spanning trees

Mathematics Subject Classification ID

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)

Recommendations

• An improved algorithm to construct edge-independent spanning trees in augmented cubes
• Constructing node-independent spanning trees in augmented cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• Independent spanning trees in crossed cubes
• Independent spanning trees on twisted cubes

Cites work

• A comment on ``Independent spanning trees in crossed cubes
• A fast parallel algorithm for constructing independent spanning trees on parity cubes
• An algorithm to construct independent spanning trees on parity cubes
• Augmented cubes
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Edge-disjoint spanning trees on the star network with applications to fault tolerance
• Independent spanning trees in crossed cubes
• Independent spanning trees on even networks
• Independent spanning trees on twisted cubes
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Independent trees in planar graphs
• On edge-disjoint spanning trees in hypercubes
• On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\)
• Reliable broadcasting in product networks
• The multi-tree approach to reliability in distributed networks
• The super connectivity of augmented cubes
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security

Cited in

(11)

• Constructing edge-disjoint spanning trees in locally twisted cubes
• Hamiltonian paths and cycles pass through prescribed edges in the balanced hypercubes
• How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?
• On edge-disjoint spanning trees in hypercubes
• The 4-set tree connectivity of hierarchical folded hypercube
• A comment on ``Independent spanning trees in crossed cubes
• Edge-disjoint paths in faulty augmented cubes
• Edge-independent spanning trees in folded crossed cubes
• Improving the diameters of completely independent spanning trees in locally twisted cubes
• Constructing node-independent spanning trees in augmented cubes
• An improved algorithm to construct edge-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)