betaFeedback

WorksMathematics

Cacti with Extremal PI Index

Abstract

The vertex PI index PI(G)=∑xy∈E(G)[nxy(x)+nxy(y)]PI(G) = \sum_{xy \in E(G)} [n_{xy}(x) + n_{xy}(y)] is a distance-based molecular structure descriptor, where nxy(x)n_{xy}(x) denotes the number of vertices which are closer to the vertex xx than to the vertex yy 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 largest and smallest vertex PI indices among all the cacti. As a consequence, we obtain the sharp bounds with corresponding extremal cacti and extend a known result.

Paper details

vlnc:W_94a853vh
Version
v1 · latest
Published
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…