Skip to main content
SpringerLink
Log in

On Doubly Resolving Sets in Graphs

  • Published:
Bulletin of the Malaysian Mathematical Sciences Society Aims and scope Submit manuscript

Abstract

Two vertices u, v in a connected graph G are doubly resolved by vertices x, y of G if

$$\begin{aligned} d(v,x)-d(u,x)\ne d(v,y)-d(u,y). \end{aligned}$$

A set W of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by some two vertices of W. Doubly resolving number of a graph G, denoted by \(\psi (G)\), is the minimum cardinality of a doubly resolving set for the graph G. The aim of this paper is to investigate doubly resolving sets in graphs. An upper bound for \(\psi (G)\) is obtained in terms of order and diameter of G. \(\psi (G)\) is computed for some graphs, and all graphs G of order n with the property \(\psi (G)=n-1\) are determined. Also, doubly resolving sets for unicyclic graphs are studied and it is proved that the difference between the number of leaves and doubly resolving number of a unicyclic graph is at most 2.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Ahmad, A., Baca, M., Sultan, S.: Minimal doubly resolving sets of necklace graph. Math. Rep. 20(70), 123–129 (2018)

    MathSciNet  MATH  Google Scholar 

  2. Bailey, R.F., Cameron, P.J.: Base size, metric dimension and other invariants of groups and graphs. Bull. Lond. Math. Soc. 43, 209–242 (2011)

    Article  MathSciNet  Google Scholar 

  3. Beerliova, Z., Eberhard, F., Erlebach, T., Hall, A., Hoffmann, M., Mihalak, M., Ram, L.S.: Network dicovery and verification. IEEE J. Sel. Areas Commun. 24(12), 2168–2181 (2006)

    Article  Google Scholar 

  4. Buczkowski, P.S., Chartrand, G., Poisson, C., Zhang, P.: On k-dimensional graphs and their bases. Periodica Mathematica Hungarica 46(1), 9–15 (2003)

    Article  MathSciNet  Google Scholar 

  5. Caceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L., Seara, C., Wood, D.R.: On the metric dimension of cartesian products of graphs. SIAM J. Discret. Math. 21(2), 423–441 (2007)

    Article  MathSciNet  Google Scholar 

  6. Cangalovic, M., Kratica, J., Kovacevic-Vujcic, V., Stojanovic, M.: Minimal doubly resolving sets of Prism graphs. Optimization 62, 1037–1043 (2013)

    Article  MathSciNet  Google Scholar 

  7. Chartrand, G., Eroh, L., Johnson, M.A., Ollermann, O.R.: Resolvability in graphs and the metric dimension of a graph. Discret. Appl. Math. 105, 99–113 (2000)

    Article  MathSciNet  Google Scholar 

  8. Chen, X., Wang, C.: Approximability of the Minimum Weighted Doubly Resolving Set Problem, Computing and combinatorics Lecture Notes in Computer Science, vol. 8591, pp. 357–368. Springer, Cham (2014)

    Google Scholar 

  9. Harary, F., Melter, R.A.: On the metric dimension of a graph. Ars Combinatoria 2, 191–195 (1976)

    MathSciNet  MATH  Google Scholar 

  10. Hernando, C., Mora, M., Pelayo, I.M., Seara, C., Wood, D.R.: Extremal Graph Theory for Metric Dimension and Diameter. Electron. J. Combinat. 17, #R30 (2010)

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

    Article  MathSciNet  Google Scholar 

  12. Kratica, J., Cangalovic, M., Kovacevic-Vujcic, V.: Computing minimal doubly resolving sets of graphs. Comput. Oper. Res. 36, 2149–2159 (2009)

    Article  MathSciNet  Google Scholar 

  13. Kratica, J., Kovacevic-Vujcic, V., Cangalovic, M., Stojanovic, M.: Minimal doubly resolving sets and the strong metric dimension of Hamming graphs. Appl. Anal. Discret. Math. 6(1), 63–71 (2012)

    Article  MathSciNet  Google Scholar 

  14. Liu, J.B., Zafari, A., Zarei, H.: Metric dimension, minimal doubly resolving sets, and the strong metric dimension for jellyfish graph and cocktail party graph. Complexity 2020, 7 (2020)

    MATH  Google Scholar 

  15. Lu, C., Ye, Q., Zhu, C.: Algorithmic aspect on the minimum (weighted) doubly resolving set problem of graphs, International Conference on Algorithmic Applications in Management, pp. 212–222. Springer

  16. Melter, R.A., Tomescu, I.: Metric bases in digital geometry. Comput. Vis. Gr. Image Process. 25, 113–121 (1984)

    Article  Google Scholar 

  17. Sebo, A., Tannier, E.: On metric generators of graphs. Math. Oper. Res. 29(2), 383–393 (2004)

    Article  MathSciNet  Google Scholar 

  18. Slater, P.J.: Leaves of trees. Congressus Numerantium 14, 549–559 (1975)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Science, Shahreza Campus, University of Isfahan, Isfahan, Iran

    Mohsen Jannesari

Authors
  1. Mohsen Jannesari
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohsen Jannesari.

Additional information

Communicated by Rosihan M. Ali.

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 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

Jannesari, M. On Doubly Resolving Sets in Graphs. Bull. Malays. Math. Sci. Soc. 45, 2041–2052 (2022). https://doi.org/10.1007/s40840-022-01366-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s40840-022-01366-1

Keywords

Mathematics Subject Classification

Search

Navigation