Iterative graph have several applications in social network analysis, optimization problems, machine learning, and game theory. Such graphs are also commonly used in chemistry, physics, and mathematics. In this article, we derive the M-polynomial for the fractal growth patterns of benzene (F GBn, n ≥ 1), the Pythagoras tree (P Tn, n ≥ 1), and the benzene dendrimer (DBn, n ≥ 2). Moreover, we compute some degree-based topological indices based on the M-polynomials, such as the first Zagreb index, the second Zagreb index, the modified second Zagreb index, the general Randi ́c index, the harmonic index, the inverse sum index, and the symmetric division degree index. Finally, we presented our work graphically and compared the sketches of M-polynomials and degree-based topological indices.
1 January 2023 in Mathematical Problems in Engineering
Chemical descriptors are numeric numbers that contain a basic chemical structure and describe the structure of a graph. A graph’s topological indices are linked to its chemical characteristics. Biological activity of chemical compounds can be predicted using topological indices. Numerous chemical indices have been developed in theoretical chemistry, including the Zagreb index, the Randić index, the Wiener index, and many others. In this paper, we compute the exact results for the Randić, Zagreb, Harmonic, augmented Zagreb, atom‐bond connectivity, and geometric‐arithmetic indices for the Benzenoid networks theoretically.
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.
7 December 2023 in Journal of Mathematical Chemistry
Two connected labelled graphs H1 and H2 of nullity one, with identical one-vertex deleted subgraphs H1 − z1 and H2 − z2 and having a common eigenvector in the nullspace of their 0-1 adjacency matrix, can be overlaid to produce the superimposition Z. The graph Z is H1 + z2 and also H2 + z1 whereas Z + e is obtained from Z by adding the edge {z1, z2}. We show that the nullity of Z cannot take all the values allowed by interlacing. We propose to classify graphs with two chosen vertices according to the type of the vertices occurring by using a 3-type-code. Out of the 27 values it can take, only 9 are hypothetically possible for Z, 8 of which are known to exist. Moreover, the SSP molecular model predicts conduction or insulation at the Fermi level of energy for 11 possible types of devices consisting of a molecule and two prescribed connecting atoms over a small bias voltage. All 11 molecular device types are realizable for general molecules, but the structure of Z and of Z + e restricts the number to just 5.
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 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.