Vertex and Edge Orbits of Fibonacci and Lucas Cubes

The Fibonacci cube ({Gamma_{n}}) is obtained from the n-cube Q _n by removing all the vertices that contain two consecutive 1s. If, in addition, the vertices that start and end with 1 are removed, the Lucas cube ({Lambda_{n}}) is obtained. The number of vertex and edge orbits, the sets of the sizes of the orbits, and the number of orbits of each size, are determined for the Fibonacci cubes and the Lucas cubes under the action of the automorphism group. In particular, the set of vertex orbit sizes of ({Lambda_{n}}) is ({{k geq 1; k |n} cup {k geq 18; k |2n}}), the number of vertex orbits of ({Lambda_{n}}) of size k, where k is odd and divides n, is equal to ({sum_{d | k} mu (frac{k}{d})F_{lfloor{frac{d}{2}}rfloor+2}}), and the number of edge orbits of ({Lambda_{n}}) is equal to the number of vertex orbits of ({Gamma_{n-3}}). Dihedral transformations of strings and primitive strings are essential tools to prove these results.