Ordering chemical unicyclic graphs by Wiener polarity index |
| |
Authors: | Ali Ghalavand Ali R. Ashrafi |
| |
Affiliation: | Department of Pure Mathematics, Faculty of Mathematical Sciences, University of Kashan, Kashan, Iran |
| |
Abstract: | Suppose 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. |
| |
Keywords: | chemical unicyclic graph graph operation Wiener polarity index |
|
|