Among the classical models for interconnection networks are hypercubes and Fibonacci
cubes. Fibonacci cubes are induced subgraphs of hypercubes obtained by restricting the …

Fibonacci Cubes have been an extremely popular area of research since the 1990s. This
unique compendium features the state of research into Fibonacci Cubes. It expands the …

Abstract Let X⊆{0, 1} n. The daisy cube Q n (X) is introduced as the subgraph of Q n
induced by the union of the intervals I (x, 0 n) over all x∈ X. Daisy cubes are partial cubes …

Fibonacci cubes are induced subgraphs of hypercube graphs obtained by restricting the
vertex set to those binary strings which do not contain consecutive 1s. This class of graphs …

Hypercubes and Fibonacci cubes are classical models for interconnection networks with
interesting graph theoretic properties. We consider k-Fibonacci cubes, which we obtain as …

Fibonacci cubes are the special subgraphs of the hypercubes. Their domination numbers
and total domination numbers are obtained for some small dimensions by integer linear …

The Fibonacci cube Γ n is the subgraph of hypercube Q n induced by the binary strings that
contain no two consecutive 1s, and the Lucas cube Λ n is obtained from Γ n by removing …

The Fibonacci cube is the subgraph of the hypercube induced by the vertices whose binary
string representations do not contain two consecutive 1s. These cubes were presented as …

We introduce alternate Lucas cubes, a new family of graphs designed as an alternative for
the well known Lucas cubes. These interconnection networks are subgraphs of Fibonacci …

Lucas and Fibonacci cubes are special subgraphs of the binary hypercubes that have been
proposed as models of interconnection networks. Since these families are closely related to …