Computation of Polynomial Degree-Based Topological Descriptors of Indu-Bala Product of Two Paths

Abstract

Cheminformatics is entirely a newly coined term that encompasses a field that includes engineering computer sciences along with basic sciences. As we all know, vertices and edges form a network whereas vertex and its degrees contribute to joining edges. The degree of vertex is very much dependent on a reasonable proportion of network properties. There is no doubt that a network has to have a reliance of different kinds of hub buses, serials, and other connecting points to constitute a system that is the backbone of cheminformatics. The Indu-Bala product of two graphs $G_1$ and $G_2$ has a special notation as described in Section 2. The attainment of this product is very much due to related vertices at to different places of $G_1\vee G_2$ . This study states we have found M-polynomial and degree-based topological indices for Indu-Bala product of two paths $P_k$ and $P_j$ for $j,k\ge 2$ . We also give some graphical representation of these indices and analyzed them graphically.