Degcity Indices of Some Networks

Abstract

Topological indices are important tools for analyzing structural properties of graphs and interconnection networks. In this paper, we compute seven eccentricity-based degcity indices for honeycomb, oxide, and hypertree networks. By employing edge partition techniques based on vertex degree and eccentricity, explicit formulae are derived for each network class. The results contribute to the theoretical study of degree-eccentricity interactions and provide useful descriptors for the analysis and design of complex network structures.