Minimum Vertex Cover in Extended Fibonacci Cubes
摘要
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}\) .