Covering and domination equivalence in ISC networks using arbitrary super subdivisions of corona graphs

Integrated Sensing and Communications (ISC) systems play a crucial role in enabling seamless data exchange between sensing devices and communication networks. This paper examines the NP-complete vertex cover problem applied to arbitrary super subdivisions of corona product graphs with cubic graphs. It is established that the domination and covering parameters are equivalent for this class of graphs. Furthermore, the relationship between modular multiplicative divisor (MMD) labeling, domination and covering parameters is investigated, with possible exceptions identified in odd arbitrary super subdivisions. By modeling ISC scenarios using graph representations, where vertices denote sensors or communication nodes and edges represent connectivity, this study provides insights into optimizing resource allocation, minimizing energy consumption and enhancing network efficiency.