Abstract
The PI index of a graph G is defined by PI(G)=∑e=(u,v)∈E[mu(e|G)+mv(e|G)] where mu(e|G) be the number of edges in G lying closer to vertex u than to vertex v and mv(e|G) be the number of edges in G lying closer to vertex v than to vertex u. In this paper, we give the upper and lower bounds on the PI index of connected unicyclic and bicyclic graphs with given girth and completely characterize the corresponding extremal graphs. From our results, it is easy to get the bounds and extremal graphs of the unicyclic and bicyclic graphs.
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.
