Vertex-pancyclicity of twisted cubes with maximal faulty edges
From MaRDI portal
Publication:4903570
DOI10.1080/00207160.2011.620093zbMath1257.05105OpenAlexW2017047076MaRDI QIDQ4903570
Publication date: 22 January 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2011.620093
Network design and communication in computer systems (68M10) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Edge-fault-tolerant vertex-pancyclicity of augmented cubes
- Fault-tolerant Hamiltonicity of twisted cubes
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Embedding of cycles in twisted cubes with edge-pancyclic
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- The two-equal-disjoint path cover problem of matching composition network
- Embedding a family of meshes into twisted cubes
- Edge-pancyclicity of Möbius cubes
- Topological properties of twisted cube
- Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\)
- Fault-tolerant cycle-embedding in alternating group graphs
- On embedding cycles into faulty twisted cubes
- Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Algorithms and Computation
This page was built for publication: Vertex-pancyclicity of twisted cubes with maximal faulty edges