Basma Mohamed1,*, Linda Mohaisen2, Mohammed Amin1
Intelligent Automation & Soft Computing, Vol.38, No.1, pp. 19-34, 2023, DOI:10.32604/iasc.2023.031947
Abstract In this paper, we consider the NP-hard problem of finding the minimum dominant 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 is dominating if every vertex of G that does not belong to B is a neighbor to some vertices in B. The dominant metric dimension of G is the cardinality number of the minimum dominant resolving set. The dominant metric dimension is computed by a binary version of the Archimedes optimization… More >
Login
Register
