Minimum neighborhood in a generalized cube

DOI10.1016/j.ipl.2005.10.003zbMath1181.68045OpenAlexW2075077860MaRDI QIDQ1045906

Jun Luo, Jianqiu Cao, Graham M. Megson, Xiaofan Yang

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.10.003

zbMATH Keywords

hypercubeinterconnection networksgeneralized cubeminimum neighborhood problem

Mathematics Subject Classification ID

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

Related Items

On the \(t/k\)-diagnosability of BC networks ⋮ Sets of binary sequences with small total Hamming distances ⋮ Strong Menger connectivity with conditional faults of folded hypercubes ⋮ Component connectivity of hypercubes ⋮ \(h\)-extra \(r\)-component connectivity of interconnection networks with application to hypercubes ⋮ A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network ⋮ Reliability evaluation of half hypercube networks ⋮ Two kinds of conditional connectivity of hypercubes ⋮ The spined cube: a new hypercube variant with smaller diameter ⋮ Generalized measures of fault tolerance in hypercube networks ⋮ Conditional connectivity of folded hypercubes ⋮ Reliability evaluation of DQcube based on \(g\)-good neighbor and \(g\)-component fault pattern ⋮ On \(g\)-extra connectivity of folded hypercubes ⋮ A (4n − 9)/3 diagnosis algorithm for generalised cube networks ⋮ Hybrid fault diagnosis capability analysis of hypercubes under the PMC model and \(\mathrm{MM}^\ast\) model ⋮ Hamiltonian properties of twisted hypercube-like networks with more faulty elements ⋮ A lower bound on the size of \(k\)-neighborhood in generalized cubes ⋮ Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks

Cites Work

• A new variation on hypercubes with smaller diameter
• Maximum number of edges joining vertices on a cube
• Maximum induced subgraph of a recursive circulant
• Parallel concepts in graph theory
• Super-connectivity and super-edge-connectivity for some interconnection networks
• Hamiltonian properties on the class of hypercube-like networks
• The Mobius cubes
• On diagnosability of large fault sets in regular topology-based computer systems
• On the maximal connected component of hypercube with faulty vertices (II)
• The locally twisted cubes
• Diagnosability of regular systems
• On the maximal connected component of hypercube with faulty vertices
• The twisted N-cube with application to multiprocessing