On the bipanpositionable bipanconnectedness of hypercubes

DOI10.1016/j.tcs.2008.11.004zbMath1171.68627OpenAlexW2080232501MaRDI QIDQ1006052

Tyne Liang, Cheng-Kuan Lin, Lih-Hsing Hsu, Jimmy J. M. Tan, Tzu-Liang Kung

Publication date: 17 March 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.11.004

zbMATH Keywords

hypercubebipartite graphinterconnection networkHamiltonian laceablebipanpositionableBipancyclic

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45)

Related Items (7)

Improving the panconnectedness property of locally twisted cubes ⋮ On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube ⋮ The 2-path-bipanconnectivity of hypercubes ⋮ Flexible cycle embedding in the locally twisted cube with nodes positioned at any prescribed distance ⋮ Cycles embedding in folded hypercubes under the conditional fault model ⋮ Optimizing Hamiltonian panconnectedness for the crossed cube architecture ⋮ Hybrid PMC (HPMC) fault model and diagnosability of interconnection networks

Cites Work

• Embedding of meshes in Möbius cubes
• Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position
• Path embedding in faulty hypercubes
• On the spanning connectivity and spanning laceability of hypercube-like networks
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Hyper-Hamilton laceable and caterpillar-spannable product graphs
• Super-connectivity and super-edge-connectivity for some interconnection networks
• Edge fault tolerance analysis of a class of interconnection networks
• Panpositionable hamiltonicity and panconnectivity of the arrangement graphs
• The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube
• Hamiltonicity of hypercubes with a constraint of required and faulty edges
• Pancyclic graphs. I
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the bipanpositionable bipanconnectedness of hypercubes