We present a new interconnection topology called the Padovan cube. Despite their asymmetric and relatively sparse interconnections, the Padovan cubes are shown to possess attractive recurrent structures. Since they can be embedded in a subgraph of the Boolean cube and can have a Fibonacci cube as a subgraph, and since they are also a supergraph of other structures, it is possible that the Padovan cubes can be useful in fault-tolerant computing. For a graph with n vertices, we characterize the Padovan cubes. We also include the number of edges, decompositions, and embeddings, as well as the diameter of the Padovan cubes.

The hypercube is one of the best models for the network topology of a distributed system. Recently, Padovan cubes and Lucas–Padovan cubes have been introduced as new interconnection topologies. Despite their asymmetric and relatively sparse interconnections, the Padovan and Lucas–Padovan cubes are shown to possess attractive recurrent structures. In this paper, we determine the cube polynomial of Padovan cubes and Lucas–Padovan cubes, as well as the generating functions for the sequences of these cubes. Several explicit formulas for the coefficients of these polynomials are obtained, in particular, they can be expressed with convolved Padovan numbers and Lucas–Padovan numbers. In particular, the coefficients of the cube polynomials represent the number of hypercubes, a symmetry inherent in Padovan and Lucas–Padovan cubes. Therefore, cube polynomials are very important for characterizing these cubes.