Vertex-pancyclicity of augmented cubes with maximal faulty edges
From MaRDI portal
Publication:726559
DOI10.1016/j.ins.2014.02.036zbMath1341.68137OpenAlexW2043467521MaRDI QIDQ726559
Publication date: 11 July 2016
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.02.036
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (6)
Edge-disjoint paths in faulty augmented cubes ⋮ Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes ⋮ Cycles embedding in balanced hypercubes with faulty edges and vertices ⋮ The vertex-pancyclicity of data center networks ⋮ Various cycles embedding in faulty balanced hypercubes ⋮ Hamiltonian paths in hypercubes with local traps
Cites Work
- Unnamed Item
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- The forwarding indices of augmented cubes
- Geodesic pancyclicity and balanced pancyclicity of augmented cubes
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- The super connectivity of augmented cubes
- Cycle embedding of augmented cubes
- Edge-pancyclicity of recursive circulants
- Edge-pancyclicity of Möbius cubes
- Fault-tolerant pancyclicity of augmented cubes
- 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
- Algorithms and Computation
This page was built for publication: Vertex-pancyclicity of augmented cubes with maximal faulty edges