Computation of Polynomial Degree-Based Topological Descriptors of Indu-Bala Product of Two Paths
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Journal of Chemistry |
| Online Access: | http://dx.doi.org/10.1155/2021/6281596 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 G1 and G2 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 G1∨G2. This study states we have found M-polynomial and degree-based topological indices for Indu-Bala product of two paths Pk and Pj for j,k≥2. We also give some graphical representation of these indices and analyzed them graphically. |
|---|---|
| ISSN: | 2090-9071 |