Weighted entropies of Tuc(5)c(8)[P;Q] nanotube with the degree based topological indices as weights

The entropy of a graph is a function depending both on the graph itself and on a probability distribution on its vertex set. This graph function originated in the problem of source coding in information theory and was introduced by J. Krner in 1973. Although the notion of graph entropy has its roots in information theory, it was proved to be closely related to some classical and frequently studied graph theoretic concepts. In this article, we captured the symmetry present in the structure of molecular graph of nanotube. We computed entropies of TUC5C8[p;q] nanotube taking some degree-based topological indices as edge weights.