Computation of edge Pi index, vertex Pi index and Szeged index of some cactus chains

Abstract

A cactus chain is a connected graph in which all blocks are cycles, each cycle has at most two cut-vertices and each cut-vertex is shared by exactly two cycles. In this paper we give exact values of edge PI index and vertex PI index of an arbitrary cactus chain and vertex Szeged index of some special types of cactus chains.