TY - JOUR
ID - 14786
TI - Cacti with extremal PI Index
JO - Transactions on Combinatorics
JA - TOC
LA - en
SN - 2251-8657
AU - Wang, Chunxiang
AU - Wang, Shaohui
AU - Wei, Bing
AD - Central China Normal University
AD - University of Mississippi
Y1 - 2016
PY - 2016
VL - 5
IS - 4
SP - 1
EP - 8
KW - Distance
KW - Extremal bounds
KW - PI index
KW - Cacti
DO - 10.22108/toc.2016.14786
N2 - The vertex PI index $PI(G) = \sum_{xy \in E(G)} [n_{xy}(x) + n_{xy}(y)]$ is a distance-based molecular structure descriptor, where $n_{xy}(x)$ denotes the number of vertices which are closer to the vertex $x$ than to the vertex $y$ and which has been the considerable research in computational chemistry dating back to Harold Wiener in 1947. A connected graph is a cactus if any two of its cycles have at most one common vertex. In this paper, we completely determine the extremal graphs with the greatest and smallest vertex PI indices mong all cacti with a fixed number of vertices. As a consequence, we obtain the sharp bounds with corresponding extremal cacti and extend a known result.
UR - https://toc.ui.ac.ir/article_14786.html
L1 - https://toc.ui.ac.ir/article_14786_f95e820e8bf0d1325600f95c8a3d7a24.pdf
ER -