1 year ago
29
Symmetry, Vol. 15, Pages 266: On the Padovan Codes and the Padovan Cubes
Symmetry doi: 10.3390/sym15020266
Authors: Gwangyeon Lee Jinsoo Kim
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.
