k-Fibonacci Cubes: A Family of Subgraphs of Fibonacci Cubes
Ömer Eğeci̇oğlu, Elif Saygı, Zülfükar Saygı · International Journal of Foundations of Computer Science · 2020
Hypercubes and Fibonacci cubes are classical models for interconnection networks with interesting graph theoretic properties. We consider [Formula: see text]-Fibonacci cubes, which we obtain as subgraphs of Fibonacci cubes by eliminating certain edges during the fundamental recursion phase of their construction. These graphs have the same number of vertices as Fibonacci cubes, but their edge sets are determined by a parameter [Formula: see text]. We obtain properties of [Formula: see text]-Fibonacci cubes including the number of edges, the average degree of a vertex, the degree sequence and the number of hypercubes they contain.