Generalized Fibonacci cubes

Citations of this article
Mendeley users who have this article in their library.


Generalized Fibonacci cube Qd(f) is introduced as the graph obtained from the d-cube Qd by removing all vertices that contain a given binary string f as a substring. In this notation, the Fibonacci cube Γd is Qd(11). The question whether Qd(f) is an isometric subgraph of Qd is studied. Embeddable and non-embeddable infinite series are given. The question is completely solved for strings f of length at most five and for strings consisting of at most three blocks. Several properties of the generalized Fibonacci cubes are deduced. Fibonacci cubes are, besides the trivial cases Qd(10) and Qd(01), the only generalized Fibonacci cubes that are median closed subgraphs of the corresponding hypercubes. For admissible strings f, the f-dimension of a graph is introduced. Several problems and conjectures are also listed. © 2011 Elsevier B.V. All rights reserved.




Ilić, A., Klavžar, S., & Rho, Y. (2012). Generalized Fibonacci cubes. Discrete Mathematics, 312(1), 2–11.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free