The extended Fibonacci cube \(\varGamma _{n}^{k}\) is a topology which has good properties for an interconnection network with respect to diameter, node degree, recursive decomposition, bipartition, embeddability, and communication algorithms. These are classes of incomplete hypercubes. In this paper, we explore certain aspects of the structure of \(\varGamma _{n}^{k}\) leading to determining a minimum vertex cover of \(\varGamma _{n}^{k}\) .

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Minimum Vertex Cover in Extended Fibonacci Cubes

  • R. StalinMary,
  • Indra Rajasingh

摘要

The extended Fibonacci cube \(\varGamma _{n}^{k}\) is a topology which has good properties for an interconnection network with respect to diameter, node degree, recursive decomposition, bipartition, embeddability, and communication algorithms. These are classes of incomplete hypercubes. In this paper, we explore certain aspects of the structure of \(\varGamma _{n}^{k}\) leading to determining a minimum vertex cover of \(\varGamma _{n}^{k}\) .