Optimal broadcasting for locally twisted cubes
From MaRDI portal
Publication:413259
DOI10.1016/j.ipl.2011.11.003zbMath1237.68019OpenAlexW2082641185MaRDI QIDQ413259
Publication date: 4 May 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.003
Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)
Related Items
How many triangles and quadrilaterals are there in an \(n\)-dimensional augmented cube?, An efficient algorithm to construct disjoint path covers of DCell networks, One-to-one disjoint path covers on alternating group graphs, Communication Performance Evaluation of the Locally Twisted Cube
Cites Work
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
- Embedding meshes into locally twisted cubes
- Constructing edge-disjoint spanning trees in locally twisted cubes
- Parallel concepts in graph theory
- Locally twisted cubes are 4-pancyclic.
- Panconnectivity of locally twisted cubes
- Fault-tolerant pancyclicity of augmented cubes
- Fault-tolerant analysis of a class of networks
- The locally twisted cubes