\((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)
From MaRDI portal
Publication:2144839
DOI10.3934/math.2021208OpenAlexW3124980597MaRDI QIDQ2144839
Xirong Xu, Huifeng Zhang, Ziming Wang, Qiang Zhang, Yuansheng Yang
Publication date: 17 June 2022
Published in: AIMS Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/math.2021208
graph theoryfault toleranceHamiltonian connectivitynetwork topological structureaugmented cube \(AQ_n\)computer network reliability
Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- Unnamed Item
- Embedding meshes into twisted-cubes
- The forwarding indices of augmented cubes
- Optimal fault-tolerant embedding of paths in twisted cubes
- Fault-tolerant embedding of paths in crossed cubes
- The super connectivity of augmented cubes
- Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position
- Fault-tolerant panconnectivity of augmented cubes
- Survey on path and cycle embedding in some networks
- On the fault-tolerant embeddings of complete binary trees in the mesh interconnection networks
- Embedding meshes into crossed cubes
- Fault-tolerant pancyclicity of augmented cubes
- Cycles Embedding in Exchanged Crossed Cube
- Distance and Short Parallel Paths in Augmented Cubes
- Automorphisms of augmented cubes
- Embedding binary trees into crossed cubes
- Augmented cubes
- Fault-Tolerant Panconnectivity of Augmented Cubes AQn
This page was built for publication: \((2n-3)\)-fault-tolerant Hamiltonian connectivity of augmented cubes \(AQ_n\)