Edge-fault-tolerant vertex-pancyclicity of augmented cubes
From MaRDI portal
Publication:656602
DOI10.1016/j.ipl.2010.04.009zbMath1229.68008OpenAlexW1968818357MaRDI QIDQ656602
Publication date: 18 January 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2010.04.009
Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items
Conditional edge-fault pancyclicity of augmented cubes ⋮ Pancyclicity of ternary \(n\)-cube networks under the conditional fault model ⋮ Vertex-pancyclicity of twisted cubes with maximal faulty edges ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Fault-Tolerant Panconnectivity of Augmented Cubes AQn ⋮ An improved algorithm to construct edge-independent spanning trees in augmented cubes ⋮ Constructing Node-Independent Spanning Trees in Augmented Cubes
Cites Work
- Unnamed Item
- The forwarding indices of augmented cubes
- Geodesic pancyclicity and balanced pancyclicity of augmented cubes
- Edge-bipancyclicity of star graphs under edge-fault tolerant
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- The super connectivity of augmented cubes
- Cycle embedding of augmented cubes
- Edge-fault-tolerant node-pancyclicity of twisted cubes
- Edge-pancyclicity of recursive circulants
- Fault-tolerant pancyclicity of augmented cubes
- Edge-bipancyclicity of conditional faulty hypercubes
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
- Fault-tolerant cycle-embedding in alternating group graphs
- The distinguishing number of the augmented cube and hypercube powers
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Augmented cubes
- Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
- A new class of interconnection networks based on the alternating group
- Embedding of cycles in arrangement graphs
