Unchanging the diameter of k-ary n-cube networks with faulty vertices

No abstract is available for this paper.

• Publication year

  2015

• Venue

  International Journal of Computational Mathematics

• Publication date

  2015-01-02

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1080/00207160.2014.890189
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Graph Theory

  2016cited by this paper
• International Journal of Computer Mathematics Editors’ Report

  2014cited by this paper
• The Conditional Diagnosability of k-Ary n-Cubes under the Comparison Diagnosis Model

  2013cited by this paper
• Extraconnectivity of k-ary n-cube networks

  2012cited by this paper
• Conditional Diagnosability of k-Ary n-Cubes under the PMC Model

  2012cited by this paper
• Hamiltonian paths and cycles with prescribed edges in the 3-ary n-cube

  2011cited by this paper
• Hamiltonian cycles passing through linear forests in k-ary n-cubes

  2011cited by this paper
• Panconnectivity and edge-pancyclicity of k-ary n-cubes

  2009cited by this paper
• Diameter variability of cycles and tori

  2008cited by this paper
• The fault-diameter of Cartesian products

  2008influential reference
• Fault-diameter of Cartesian graph bundles

  2006cited by this paper
• Blue Gene/L torus interconnection network

  2005cited by this paper
• Fault diameter of Cartesian product graphs

  2005cited by this paper
• On k-ary n-cubes: Theory and Applications

  2003cited by this paper
• Fault Diameter of k-ary n-cube Networks

  1997influential reference
• On Embedding Cycles in k-Ary n-Cubes

  1997cited by this paper
• Lee Distance and Topological Properties of k-ary n-cubes

  1995influential reference
• Cray T3D: a new dimension for Cray Research

  1993cited 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
• Changing and Unchanging the Diameter of a Hypercube

  1992cited by this paper
• Performance of the Intel iPSC/860 and Ncube 6400 hypercubes

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

  1991influential reference
• iWarp: a 100-MOPS, LIW microprocessor for multicomputers

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

  1991influential reference
• Multicomputers: message-passing concurrent computers

  1988cited by this paper
• Fault diameter of interconnection networks

  1987cited by this paper

• No citing papers are available for this paper.