The bipanconnectivity and \(m\)-panconnectivity of the folded hypercube

DOI10.1016/j.tcs.2007.07.005zbMath1125.68087OpenAlexW2019896606MaRDI QIDQ2456377

Jywe-Fei Fang

Publication date: 18 October 2007

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

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

zbMATH Keywords

algorithmsinterconnection networksfolded hypercubespanconnectivity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items

Bipanconnectivity of balanced hypercubes ⋮ Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements ⋮ An efficient construction of one-to-many node-disjoint paths in folded hypercubes ⋮ Fault-tolerant embedding of paths in crossed cubes ⋮ Fault-free cycles in folded hypercubes with more faulty elements ⋮ Some results on topological properties of folded hypercubes ⋮ Broadcasting secure messages via optimal independent spanning trees in folded hypercubes ⋮ The panpositionable panconnectedness of augmented cubes ⋮ On the bipanpositionable bipanconnectedness of hypercubes ⋮ The bicube: an interconnection of two hypercubes

Cites Work

• Unnamed Item
• Disjoint cycles and spanning graphs of hypercubes
• The treewidth and pathwidth of hypercubes
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes
• Edge-pancyclic block-intersection graphs
• The square of a block is vertex pancyclic
• The vulnerability of the diameter of folded \(n\)-cubes
• Pancyclicity of recursive circulant graphs
• Embedding Hamiltonian cycles into folded hypercubes with faulty links
• Task assignment in heterogeneous computing systems
• Hamiltonian properties on the class of hypercube-like networks
• Cycles in folded hypercubes
• Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
• Efficient generation of the binary reflected gray code and its applications
• Embedding graphs onto the Supercube
• Complete binary trees in folded and enhanced cubes
• Embedding cycles and meshes onto incomplete hypercubes
• Efficient Embeddings into Hypercube-like Topologies