Hypercubes and Fibonacci cubes are classical models for interconnection networks with
interesting graph theoretic properties. We consider k-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 k. We obtain
properties of k-Fibonacci cubes including the number of edges, the average degree of a
vertex, the degree sequence and the number of hypercubes they contain.
Document k-FIbonacci Cubes TR