Sandhiya, P (2025) Computation of Weighted PI Index of Lexicographic product graphs and for Silicates Networks. International Journal of Neutrosophic Science, 25 (3). pp. 312-321.
Text
Computation of Weighted PI Index of Lexicographic product graphs and for Silicates Networks.pdf - Published Version
Available under License Creative Commons Attribution.
Download (281kB)
Computation of Weighted PI Index of Lexicographic product graphs and for Silicates Networks.pdf - Published Version
Available under License Creative Commons Attribution.
Download (281kB)
Official URL: https://doi.org/10.54216/IJNS.250328
Abstract
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)].
Item Type: | Article |
---|---|
Uncontrolled Keywords: | Path; Cycle; Complete graph; Weighted PI Index; Lexicographic Product; Silicate network |
Subjects: | I Mathematics > Topology I Mathematics > Graph Theory |
Divisions: | Mathematics |
Depositing User: | Dr Krishnamurthy V |
Date Deposited: | 10 Jan 2025 06:20 |
Last Modified: | 10 Jan 2025 06:21 |
URI: | https://ir.psgitech.ac.in/id/eprint/1302 |