Topological Indices, Graph Spectra, Entropies, Laplacians, and Matching Polynomials of n-Dimensional Hypercubes

Abstract

We obtain a large number of degree and distance-based topological indices, graph and Laplacian spectra and the corresponding polynomials, entropies and matching polynomials of n-dimensional hypercubes through the use of Hadamard symmetry and recursive dynamic computational techniques. Moreover, computations are used to provide independent numerical values for the topological indices of the 11- and 12-cubes. We invoke symmetry-based recursive Hadamard transforms to obtain the graph and Laplacian spectra of nD-hypercubes and the computed numerical results are constructed for up to 23-dimensional hypercubes. The symmetries of these hypercubes constitute the hyperoctahedral wreath product groups which also pave the way for the symmetry-based elegant computations. These results are used to independently validate the exact analytical expressions that we have obtained for the topological indices as well as graph, Laplacian spectra and their polynomials. We invoke a robust dynamic programming technique to handle the computationally intensive generation of matching polynomials of hypercubes and compute all matching polynomials up to the 6-cube. The distance degree sequence vectors have been obtained numerically for up to 108-dimensional cubes and their frequencies are found to be in binomial distributions akin to the spectra of n-cubes.