Computation of Weighted PI Index of Lexicographic product graphs and for Silicates Networks

The study of chemical compounds’ molecular structures is one of the most cutting-edge uses of graph theory, along with computer science, nanochemistry, network design in electrical and electronic engineering, and the depiction of graphs in Google Maps. The degree and distance between vertices of a graph are the basis for examining topological indices. The formula for computing the Weighted Padmakar Ivan index (WPI) of a graph G is PIw(G) = P e∈E(G) [(dG(u) + dG(v)][|V (G)| − NG(e)].