Minimum neighborhood in a generalized cube

DOI10.1016/J.IPL.2005.10.003MaRDI QIDQ1045906zbMATH OpenOpenAlexFDO

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

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

generalized cubehypercubeinterconnection networksminimum neighborhood problem

Mathematics Subject Classification ID

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

Recommendations

• A lower bound on the size of \(k\)-neighborhood in generalized cubes
• Generalized connectivity of generalized hypercubes
• scientific article; zbMATH DE number 861408
• On a coloring problem on the n-cube
• The generalized 4-connectivity of hypercubes

Cites work

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

Cited in

(23)

• Sets of binary sequences with small total Hamming distances
• Conditional connectivity of folded hypercubes
• Hybrid fault diagnosis capability analysis of hypercubes under the PMC model and \(\mathrm{MM}^\ast\) model
• The spined cube: a new hypercube variant with smaller diameter
• Reliability evaluation of DQcube based on g-good neighbor and g-component fault pattern
• A lower bound on the size of \(k\)-neighborhood in generalized cubes
• 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
• On the t/k-diagnosability of BC networks
• A (4n − 9)/3 diagnosis algorithm for generalised cube networks
• Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
• Generalized measures of fault tolerance in hypercube networks
• On g-extra connectivity of folded hypercubes
• Hamiltonian properties of twisted hypercube-like networks with more faulty elements
• Reliability evaluation of half hypercube networks
• Two kinds of conditional connectivity of hypercubes
• The non-inclusion diagnosability of hypercubes under the PMC model
• Structure connectivity of folded crossed cubes based on faulty stars
• Fault tolerability analysis of hypercubes based on the g-cyclic fault pattern
• The non-inclusive component diagnosability of hypercubes
• Two-round probabilistic diagnosis algorithm for fault identification
• A \((4n - 9)/3\) diagnosis algorithm on \(n\)-dimensional cube network

This page was built for publication: Minimum neighborhood in a generalized cube

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1045906)