The bicube: an interconnection of two hypercubes
From MaRDI portal
Publication:4983266
DOI10.1080/00207160.2014.890715zbMath1408.05118OpenAlexW1995175401MaRDI QIDQ4983266
Hyeong-Seok Lim, Hee-Chul Kim, Jung-Heum Park
Publication date: 25 March 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2014.890715
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Reliability Evaluation of Bicube-Based Multiprocessor System under the g-Good-Neighbor Restriction ⋮ The component connectivity, component diagnosability, and \(t/k\)-diagnosability of bicube networks ⋮ Two-disjoint-cycle-cover vertex bipancyclicity of bipartite hypercube-like networks ⋮ On linear layout of bicube and construction of optimal incomplete bicube ⋮ Fault diagnosability of bicube networks under the PMC diagnostic model ⋮ Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs ⋮ Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes ⋮ The unpaired many-to-many \(k\)-disjoint paths in bipartite hypercube-like networks
Cites Work
- Unnamed Item
- Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
- On the generalized twisted cube
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
- Recursive circulants and their embeddings among hypercubes
- The spined cube: a new hypercube variant with smaller diameter
- Hamiltonian properties on the class of hypercube-like networks
- The spanning laceability on the faulty bipartite hypercube-like networks
- The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
- Thek-degree Cayley graph and its topological properties
- General-demand disjoint path covers in a graph with faulty elements