Bounds on Product Version of Distance-Related Topological Indices of Complement of Mycielskian Graph

Abstract

Eccentricity-based topological indices are valuable descriptors for analyzing molecular graphs and complex networks. This paper focuses on the complement of the Mycielskian graph of a connected graph. We derive new upper bounds for several recently introduced eccentricity-related topological indices by exploiting the structural characteristics of the complement graph. The obtained inequalities improve the theoretical understanding of these descriptors and provide efficient estimates for transformed graphs. The proposed results offer new insights into complement graph theory and support further applications in chemical graph theory and related fields.