The work presents the graphs of Fibonacci cubes, $k$-Fibonacci cubes and Fibonacci-run graphs. The structure of these graphs is analyzed, with vertices and edges counted, and vertex degrees, radius, and diameter calculated. The work also describes properties such as Hamiltonicity, domination, the number of induced hypercubes, and whether the graphs are partial cubes. For Fibonacci cubes, all results are already known. New results for $k$-Fibonacci cubes are presented in the sections on vertex degree, Hamiltonicity and partial cubes. New results for Fibonacci-run graphs are found in the section on vertex degree and domination.
|
