AbstractThe Szeged index of a connected graph () 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.