Skip to main content
Log in

The doubly metric dimensions of cactus graphs and block graphs

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

Abstract

Given a connected graph G, two vertices \(u,v\in V(G)\) doubly resolve \(x,y\in V(G)\) if \(d_{G}(x,u)-d_{G}(y,u)\ne d_{G}(x,v)-d_{G}(y,v)\). The doubly metric dimension \(\psi (G)\) of G is the cardinality of a minimum set of vertices that doubly resolves each pair of vertices from V(G). It is well known that deciding the doubly metric dimension of G is NP-hard. In this work we determine the exact values of doubly metric dimensions of unicyclic graphs which completes the known result. Furthermore, we give formulae for doubly metric dimensions of cactus graphs and block graphs.

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.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Data availability

This work has no associated data.

References

  • Cáceres J, Hernando C, Mora M, Pelayo IM, Puertas ML, Seara C, Wood DR (2007) On the metric dimension of Cartesian products of graphs. SIAM J Discrete Math 21: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: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:99–113

    Article  MathSciNet  Google Scholar 

  • Chen X, Hu X, Wang C (2016) Approximation for the minimum cost doubly resolving set problem. Theor Comput Sci 609:526–543

    Article  MathSciNet  Google Scholar 

  • Chen X, Wang C (2014) Approximability of the minimum weighted doubly resolving set problem. Comput Combin Lect Notes Comput Sci 8591:357–368

    MathSciNet  Google Scholar 

  • Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York

    Google Scholar 

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

    MathSciNet  Google Scholar 

  • Hernando C, Mora M, Pelayo IM, Seara C, Wood DR (2010) Extremal graph theory for metric dimension and diameter. Electron J Combin 17:R30

    Article  MathSciNet  Google Scholar 

  • Hertz A (2020) An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes. Optim Lett 14:355–367

    Article  MathSciNet  Google Scholar 

  • Jannesari M (2022) On doubly resolving sets in graphs. Bull Malays Math Sci Soc 45:2041–2052

    Article  MathSciNet  Google Scholar 

  • Jannesari M (2023) Graphs with doubly resolving number 2. Discrete Appl Math 339:178–183

    Article  MathSciNet  Google Scholar 

  • Jiang Z, Polyanskii N (2019) On the metric dimension of Cartesian powers of a graph. J Combin Theory Ser A 165:1–14

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  • Klavžar S, Tavakoli M (2020) Local metric dimension of graphs: generalized hierarchical products and some applications. Appl Math Comput 364:124676

    MathSciNet  Google Scholar 

  • Klavžar S, Tavakoli M (2021) Edge metric dimensions via hierarchical product and integer linear programming. Optim Lett 15:1993–2003

    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: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:63–71

  • 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:9790–9801

  • Liu J, Zafari A (2020) Computing minimal doubly resolving sets and the strong metric dimension of the layer sun graph and the line graph of the layer sun graph. Complexity 2020:6267072

  • Liu J, Zafari A (2022) Some resolving parameters in a class of Cayley graphs. J Math 2022:9444579

  • Lu C, Ye Q (2022) A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem. Discrete Appl Math 309:147–159

    Article  MathSciNet  Google Scholar 

  • Lu C, Ye Q, Zhu C (2022) Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs. J Comb Optim 44:2029–2039

    Article  MathSciNet  Google Scholar 

  • Mladenović N, Kratica J, Kovačević-Vujčić V, Čangalović M (2012) Variable neighborhood search for metric dimension and minimal doubly resolving set problems. Eur J Oper Res 220:328–337

    Article  MathSciNet  Google Scholar 

  • Nie K, Xu K (2023a) The doubly metric dimension of cylinder graphs and torus graphs. Bull Malays Math Sci Soc 46:24

  • Nie K, Xu K (2023b) Mixed metric dimension of some graphs. Appl Math Comput 442:127737

  • Nie K, Xu K (2023c) The doubly metric dimension of corona product graphs. Filomat 37:4375–4386

  • Sedlar J, Škrekovski R (2021) Bounds on metric dimensions of graphs with edge disjoint cycles. Appl Math Comput 396:125908

    MathSciNet  Google Scholar 

  • Sedlar J, Škrekovski R (2022) Vertex and edge metric dimensions of unicyclic graphs. Discrete Appl Math 314:81–92

    Article  MathSciNet  Google Scholar 

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

    MathSciNet  Google Scholar 

  • Sultan S, Bača M, Ahmad A, Imran M (2022) Minimal doubly resolving sets of antiprism graphs and Möbius ladders. Miskolc Math Notes 23:457–469

    Article  MathSciNet  Google Scholar 

  • Wei M, Yue J, Chen L (2022) The effect of vertices and edge deletion on the edge metric dimension of graphs. J Combin Optim 44:331–342

    Article  Google Scholar 

  • Zhang Y, Gao S (2020) On the edge metric dimension of convex polytopes and its related graphs. J Combin Optim 39:334–350

    Article  MathSciNet  Google Scholar 

  • Zhu E, Peng S, Liu C (2022) Identifying the exact value of the metric dimension and edge dimension of unicyclic graphs. Mathematics 10:3539

    Article  Google Scholar 

Download references

Acknowledgements

We sincerely thank two anonymous referees for their careful reading and some helpful comments on our paper.

Funding

This work was supported by NNSF of China (Grant No. 12271251).

Author information

Authors and Affiliations

Authors

Contributions

All authors have made equal contributions to this work.

Corresponding author

Correspondence to Kexiang Xu.

Ethics declarations

Conflict of interest

The authors have no Conflict of interest.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Nie, K., Xu, K. The doubly metric dimensions of cactus graphs and block graphs. J Comb Optim 47, 67 (2024). https://doi.org/10.1007/s10878-024-01168-0

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10878-024-01168-0

Keywords

Mathematics Subject Classification

Navigation