Search

Shannon entropy, also known as information entropy or entropy, measures the uncertainty or randomness of probability distribution. Entropy is measured in bits, quantifying the average amount of information required to identify an event from the distribution. Shannon's entropy theory initiates graph entropies and develops information-theoretic magnitudes for structural computational evidence of organic graphs and complex networks. Graph entropy measurements are valuable in several scientific fields, such as computing, chemistry, biology, and discrete mathematics. In this study, we investigate the entropy of fractal-type networks by considering cycle, complete, and star networks as base graphs using degree-based topological indices. [ABSTRACT FROM AUTHOR]

Topological indices are empirical features of graphs that characterize the topology of the graph and, for the most part, are graph independent. An important branch of graph theory is chemical graph theory. In chemical graph theory, the atoms corresponds vertices and edges corresponds covalent bonds. A topological index is a numeric number that represents the topology of underline structure. In this article, we examined the topological properties of prism octahedron network of dimension m and computed the total eccentricity, average eccentricity, Zagreb eccentricity, geometric arithmetic eccentricity, and atom bond connectivity eccentricity indices, which are used to utilize the distance between the vertices of a prism octahedron network. [ABSTRACT FROM AUTHOR]

A branch of graph theory that makes use of a molecular graph is called chemical graph theory. Chemical graph theory is used to depict a chemical molecule. A graph is connected if there is an edge between every pair of vertices. A topological index is a numerical value related to the chemical structure that claims to show a relationship between chemical structure and various physicochemical attributes, chemical reactivity, or, you could say, biological activity. In this article, we examined the topological properties of a planar octahedron network of m dimensions and computed the total eccentricity, average eccentricity, Zagreb eccentricity, geometric arithmetic eccentricity, and atom bond connectivity eccentricity indices, which are used to determine the distance between the vertices of a planar octahedron network. [ABSTRACT FROM AUTHOR]