Skip to main content
Log in

Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

Let G be a simple graph, where each vertex has a nonnegative weight. A vertex subset S of G is a doubly resolving set (DRS) of G if for every pair of vertices uv in G, there exist \(x,y\in S\) such that \(d(x,u)-d(x,v)\ne d(y,u)-d(y,v)\). The minimum weighted doubly resolving set (MWDRS) problem is finding a doubly resolving set with minimum total weight. We establish a linear time algorithm for the MWDRS problem of all graphs in which each block is complete graph or cycle. Hence, the MWDRS problems for block graphs and cactus graphs can be solved in linear time. We also prove that k-edge-augmented tree (a tree with additional k edges) with minimum degree \(\delta (G)\ge 2\) admits a doubly resolving set of size at most \(2k+1\). This implies that the DRS problem on k-edge-augmented tree can be solved in \(O(n^{2k+3})\) time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Bailey RF, Cameron PJ (2011) Base size, metric dimension and other invariants of groups and graphs. Bull Lond Math Soc 43(2):209–242

    Article  MathSciNet  Google Scholar 

  • Cáceres J, Hernando C, Mora M, Pelayo IM, MaL Puertas, Seara C, Wood DR (2007) On the metric dimension of Cartesian products of graphs. SIAM J Discrete Math 21(2):423–441

    Article  MathSciNet  Google Scholar 

  • Čangalović M, Kratica J, Kovačević-Vujčić V, Stojanović M (2013) Minimal doubly resolving sets of prism graphs. Optimization 62(8):1037–1043

    Article  MathSciNet  Google Scholar 

  • Chartrand G, Eroh L, Johnson MA, Oellermann OR (2000) Resolvability in graphs and the metric dimension of a graph. Discrete Appl Math 105(1–3):99–113

    Article  MathSciNet  Google Scholar 

  • Chen X, Wang C (2014) Approximability of the minimum weighted doubly resolving set problem. In: Computing and combinatorics. Lecture notes in computer science, vol 8591. Springer, Cham, pp 357–368

  • Chen L, Lu C, Zeng Z (2010) Labelling algorithms for paired-domination problems in block and interval graphs. J Comb Optim 19(4):457–470

    Article  MathSciNet  Google Scholar 

  • Díaz J, Pottonen O, Serna M, van Leeuwen EJ (2012) On the complexity of metric dimension. In: Algorithms—ESA 2012. Lecture notes in computer science, vol 7501. Springer, Heidelberg, pp 419–430

  • Epstein L, Levin A, Woeginger GJ (2015) The (weighted) metric dimension of graphs: hard and easy cases. Algorithmica 72(4):1130–1171

    Article  MathSciNet  Google Scholar 

  • Gomez-Rodriguez M, Leskovec J, Krause A (2012) Inferring networks of diffusion and influence. ACM Trans Knowl Discov Data 5(4):21

    Article  Google Scholar 

  • Harary F, Melter R (1976) On the metric dimension of a graph. Ars Comb 2(191–195):1

    MATH  Google Scholar 

  • Khuller S, Raghavachari B, Rosenfeld A (1996) Landmarks in graphs. Discrete Appl Math 70(3):217–229

    Article  MathSciNet  Google Scholar 

  • Kratica J, Čangalović M, Kovačević-Vujčić V (2009) Computing minimal doubly resolving sets of graphs. Comput Oper Res 36(7):2149–2159

    Article  MathSciNet  Google Scholar 

  • Kratica J, Kovačević-Vujčić V, Čangalović M, Stojanović M (2012a) Minimal doubly resolving sets and the strong metric dimension of Hamming graphs. Appl Anal Discrete Math 6(1):63–71

    Article  MathSciNet  Google Scholar 

  • Kratica J, Kovačević-Vujčić V, Čangalović M, Stojanović M (2012b) Minimal doubly resolving sets and the strong metric dimension of some convex polytopes. Appl Math Comput 218(19):9790–9801

    MathSciNet  MATH  Google Scholar 

  • Pinto PC, Thiran P, Vetterli M (2012) Locating the source of diffusion in large-scale networks. Phys Rev Lett 109(6):068702

    Article  Google Scholar 

  • Shah D, Zaman T (2011) Rumors in a network: who’s the culprit? IEEE Trans Inf Theory 57(8):5163–5181

    Article  MathSciNet  Google Scholar 

  • Slater PJ (1975) Leaves of trees. Congr Numer 14(549–559):37

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Changhong Lu.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supported in part by National Natural Science Foundation of China (No. 11871222) and Science and Technology Commission of Shanghai Municipality (Nos. 18dz2271000, 19jc1420100).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lu, C., Ye, Q. & Zhu, C. Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs. J Comb Optim 44, 2029–2039 (2022). https://doi.org/10.1007/s10878-020-00575-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-020-00575-3

Keywords

Navigation