Minimum neighborhood in a generalized cube

@article{Yang2006MinimumNI,
  title={Minimum neighborhood in a generalized cube},
  author={Xiaofan Yang and Jianqiu Cao and Graham M. Megson and Jun Luo},
  journal={Inf. Process. Lett.},
  year={2006},
  volume={97},
  pages={88-93}
}
Generalized cubes are a subclass of hypercube-like networks, which include some hypercube variants as special case θG(k) denote the minimum number of nodes adjacent to a set of k vertices of a graphG. In this paper, we prove θG(k) −2k + (2n − 3 2)k − (n2 − 2) for eachn-dimensional generalized cube and each integer k satisfyingn + 2 k 2n. Our result is an extensio of a result presented by Fan and Lin [J. Fan, X. Lin, The t/k-diagnosability of the BC graphs, IEEE Trans. Comput. 54 (2) (20 176–184… CONTINUE READING
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-10 of 21 references

Similar Papers

Loading similar papers…