Abstract
The vertex PI index is a distance-based molecular structure descriptor, that recently found numerous chemical applications. In order to increase diversity of this topological index for bipartite graphs, we introduce a weighted version defined as PIw(G)=∑e=uv∈E(deg(u)+deg(v))(nu(e)+nv(e)), where deg(u) denotes the vertex degree of u and nu(e) denotes the number of vertices of G whose distance to the vertex u is smaller than the distance to the vertex v. We establish basic properties of PIw(G), and prove various lower and upper bounds. In particular, the path Pn has minimal, while the complete tripartite graph Kn/3,n/3,n/3 has maximal weighed vertex PI index among connected graphs with n vertices. We also compute exact expressions for the weighted vertex PI index of the Cartesian product of graphs. Finally we present modifications of two inequalities and open new perspectives for the future research.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
