An n-dimensional hypercube, Q_n, is a graph in which vertices are binary strings of length n where two vertices are adjacent if they differ in exactly one coordinate. Hypercubes and their subgraphs have a lot of applications in different fields of science, specially in computer science. This is the reason why they have been investigated by many authors during the years. Some of their subgraphs named Fibonacci cubes and Lucas cubes are very important and are useful in interconnection networks. In this paper, after introducing these cubes, we report their metric and combinatorial properties done by different authors. Then, we present some open problems that we have been encountered during our research regarding these cubes. Finally, we briefly introduce the software named Sage which is very applicable in the calculations for theses cubes in high dimensions.
Fathalikhani, K., & Ashrafi, A. R. (2021). Metric and Combinatorial Properties of Fibonacci and Lucas cubes. Soft Computing Journal, 5(1), 78-100.
MLA
Khadijeh Fathalikhani; Ali Reza Ashrafi. "Metric and Combinatorial Properties of Fibonacci and Lucas cubes", Soft Computing Journal, 5, 1, 2021, 78-100.
HARVARD
Fathalikhani, K., Ashrafi, A. R. (2021). 'Metric and Combinatorial Properties of Fibonacci and Lucas cubes', Soft Computing Journal, 5(1), pp. 78-100.
VANCOUVER
Fathalikhani, K., Ashrafi, A. R. Metric and Combinatorial Properties of Fibonacci and Lucas cubes. Soft Computing Journal, 2021; 5(1): 78-100.
)