Extended fault-tolerant bipanconnectivity and panconnectivity of folded hypercubes

No abstract is available for this paper.

• Publication year

  2014

• Venue

  International Journal of Mobile Communications

• Publication date

  2014-07-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1504/IJMC.2014.063655
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Fault-tolerant path embedding in folded hypercubes with both node and edge faults

  2013cited by this paper
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes

  2011cited by this paper
• The super connectivity of exchanged hypercubes

  2011cited by this paper
• Regular connected bipancyclic spanning subgraphs of hypercubes

  2011cited by this paper
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

  2011cited by this paper
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes

  2010cited by this paper
• The spanning connectivity of folded hypercubes

  2010cited by this paper
• Some results on topological properties of folded hypercubes

  2009cited by this paper
• A further result on fault-free cycles in faulty folded hypercubes

  2009cited by this paper
• 1-vertex-fault-tolerant Cycles Embedding on Folded Hypercubes

  2009cited by this paper
• Fault-free cycles in folded hypercubes with more faulty elements

  2008cited by this paper
• A note on cycle embedding in folded hypercubes with faulty elements

  2008cited by this paper
• Some edge‐fault‐tolerant properties of the folded hypercube

  2008cited by this paper
• The bipanconnectivity and m-panconnectivity of the folded hypercube

  2007cited by this paper
• Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes

  2007cited by this paper
• Edge-fault-tolerant properties of hypercubes and folded hypercubes

  2006cited by this paper
• Cycles in folded hypercubes

  2006cited by this paper
• Edge-fault-tolerant hamiltonicity of folded hypercubes

  2006cited by this paper
• Fault-tolerant cycle embedding in the hypercube with more both faulty vertices and faulty edges

  2006cited by this paper
• Linear array and ring embeddings in conditional faulty hypercubes

  2004cited by this paper
• Fault-tolerant cycle embedding in the hypercube

  2003cited by this paper
• Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes

  2003cited by this paper
• Fault-tolerant hamiltonian laceability of hypercubes

  2002cited by this paper
• Embedding Hamiltonian Cycles into Folded Hypercubes with Faulty Links

  2001cited by this paper
• Embedding a Ring in a Hypercube with Both Faulty Links and Faulty Nodes

  1996cited by this paper
• Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)

  1992cited by this paper
• Optimal ring embedding in hypercubes with faulty links

  1992cited by this paper
• Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes

  1991influential reference
• The Twisted N-Cube with Application to Multiprocessing

  1991cited by this paper
• Properties and Performance of Folded Hypercubes

  1991cited by this paper
• The cube-connected-cycles: A versatile network for parallel computation

  1979cited by this paper

• Paths in Folded Hypercubes With Any Pair of Faulty Vertices

  2025cites this paper