On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network
From MaRDI portal
Publication:508669
DOI10.1016/j.ins.2014.07.037zbMath1404.68019OpenAlexW1990242174MaRDI QIDQ508669
Chien-Hung Huang, Jywe-Fei Fang
Publication date: 7 February 2017
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2014.07.037
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
Super spanning connectivity on WK-recursive networks ⋮ Structure fault tolerance of WK-recursive networks
Cites Work
- Node-pancyclicity and edge-pancyclicity of crossed cubes
- Node-pancyclicity and edge-pancyclicity of hypercube variants
- Hamiltonian connectivity of the WK-recursive network with faulty nodes
- Edge-pancyclicity of Möbius cubes
- Pancyclicity of recursive circulant graphs
- Vertex 6-pancyclic in-tournaments
- Task assignment in heterogeneous computing systems
- Hamiltonian properties on the class of hypercube-like networks
- The \(m\)-pancycle-connectivity of a WK-recursive network
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Embedding graphs onto the Supercube
- Hypercomplete: A pancyclic recursive topology for large-scale distributed multicomputer systems
- Unnamed Item
- Unnamed Item
This page was built for publication: On vertex-pancyclicity and edge-pancyclicity of the WK-recursive network