We compute the values of Szeged index of hollow hexagons using the cut method. Hollow hexagons are primitive coronoid systems with exactly six angularly annelated hexagons. The cut method is used to compute the value of the index in terms of the Szeged index of weighted quotient graphs with respect to a c-partition of the edge set.

Abstract

The Szeged index of a connected graph G$$ G $$ (Sz(G)$$ Sz(G) $$) is a well known distance based topological index. A primitive coronoid system is a coronoid system formed by a single chain in a macro-cyclic arrangement consisting of linearly and angularly annelated hexagons. The angular hexagons are called corners. A hollow hexagon is a primitive coronoid system with exactly six corners. In this paper we calculate the values of Szeged index of hollow hexagons using the cut method.