Partition Dimension of Generalized Hexagonal Cellular Networks and Its Application

Abstract

The notion of partition dimension was initially introduced in the field of graph theory, primarily to examine distances between vertices. The local partition dimension extends this idea by incorporating specific conditions into how vertices are represented. In graph theory, it is customary to represent the partition dimension of a graph as $pd(G)$ . Network localization, on the other hand, is the process of precisely determining the position of nodes within a network concerning a selected subset of nodes, called the locating set. The smallest size of its locating set is used to represent the locating number of a network. The generalized hexagonal cellular network provides an innovative framework for network planning and analysis. In our study, we investigate the partition dimension of a generalized hexagonal cellular network and provide a rigorous proof of its exact partition dimension. Hence, our approach ensures the distinct recognition of each node within a generalized hexagonal cellular network. Additionally, we explore the utilization of the metric dimension in flood relief camping by the National Disaster Management Authority (NDMA) Pakistan during floods in 2022. NDMA established relief camps and relief centers with unique codes to rescue humans and animals.

Keywords

• Vertex-based metric resolvability
• resolving set
• metric dimension
• vertex-based partition resolvability
• partition resolving set
• partition dimension