Abstract
AbstractSuppose G is a chemical graph with vertex set V(G). Define D(G) = {{u, v} ⊆ V (G) | d G (u, v) = 3}, where d G (u, v) denotes the length of the shortest path between u and v. The Wiener polarity index of G, W p (G), is defined as the size of D(G). In this article, an ordering of chemical unicyclic graphs of order n with respect to the Wiener polarity index is given.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
