Computing Connected Resolvability of Graphs Using Binary Enhanced Harris Hawks Optimization

Abstract

In this paper, we consider the NP-hard problem of finding the minimum connected resolving set of graphs. A vertex set B of a connected graph G resolves G if every vertex of G is uniquely identified by its vector of distances to the vertices in B. A resolving set B of G is connected if the subgraph B induced by B is a nontrivial connected subgraph of G. The cardinality of the minimal resolving set is the metric dimension of G and the cardinality of minimum connected resolving set is the connected metric dimension of G. The problem is solved heuristically by a binary version of an enhanced Harris Hawk Optimization (BEHHO) algorithm. This is the first attempt to determine the connected resolving set heuristically. BEHHO combines classical HHO with opposition-based learning, chaotic local search and is equipped with an S-shaped transfer function to convert the continuous variable into a binary one. The hawks of BEHHO are binary encoded and are used to represent which one of the vertices of a graph belongs to the connected resolving set. The feasibility is enforced by repairing hawks such that an additional node selected from V\B is added to B up to obtain the connected resolving set. The proposed BEHHO algorithm is compared to binary Harris Hawk Optimization (BHHO), binary opposition-based learning Harris Hawk Optimization (BOHHO), binary chaotic local search Harris Hawk Optimization (BCHHO) algorithms. Computational results confirm the superiority of the BEHHO for determining connected metric dimension.

Hybridizing Slime Mould Algorithm with Simulated Annealing for Solving Metric Dimension Problem<br /> <div> <br /> </div>

“…Moreover, the bitwise operations can increase the diversity of the population. Also, see more details in the literature [17][18][19][20].…”

Connected metric dimension of the class of ladder graphs

“…According to [2], the connected metric dimension of the wheel graph 𝑊 , 𝑛 ≥ 7, is + 1, while it is for the Petersen graph 𝑃 is 4, and if 𝑣 is an end vertex of the tree 𝑇, then it is at a vertex of 𝑇; otherwise, it is at a vertex of 𝑇 that is 2. Further information might be found in the literature [16][17][18][19][20][21][22], and some future notions may be applied to some applications like [23,24].…”

The Secure Metric Dimension of the Globe Graph and the Flag Graph

“…Later, the aforementioned theory was independently discovered by Harary and Melter [4]. Sebo and Tannier [5], Mohamed et al [6], Amin et al [7], and Borchert et al [8] have all conducted diferent research on the idea of the metric dimension of graphs. Meanwhile, Imran et al [9] studied the metric dimension of the generalized Petersen multigraphs P(2n, n), which are the barycentric subdivision of Möbius ladders and established that they have metric dimensions of 3 and when n is even and 4 when n is odd.…”