Skip to main content
Log in

Graphs of Order n with Determining Number \(n{-}3\)

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

A set S of vertices is a determining set of a graph G if every automorphism of G is uniquely determined by its action on S. The determining number of G, denoted by \(\mathrm{Det}(G)\), is the smallest size of a determining set. In this paper, we give an explicit characterization for connected graphs of order n with determining number \(n-3\)

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

Similar content being viewed by others

References

  1. Albertson, M.O., Boutin, D.L.: Using determining sets to distinguish Kneser graphs. Electron. J. Combin. 14(1), R20 (2007)

    Article  MathSciNet  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. Bailey, R.F., Meagher, K.: On the metric dimension of Grassmann graphs. Discrete Math. Theor. Comput. Sci. 13, 97–104 (2011)

    MathSciNet  MATH  Google Scholar 

  4. Bailey, R.F., Cáceres, J., Garijo, D., González, A., Márquez, A., Meagher, K., Puertas, M.L.: Resolving sets for Johnson and Kneser graphs. Eur. J. Combin. 34, 736–751 (2013)

    Article  MathSciNet  Google Scholar 

  5. Boutin, D.L.: Identifying graphs automorphisms using determining sets. Electron. J. Combin. R13(1), 78 (2006)

    Article  MathSciNet  Google Scholar 

  6. Boutin, D.L.: The determining number of a Cartesian product. J. Graph Theory 61(2), 77–87 (2009)

    Article  MathSciNet  Google Scholar 

  7. Cácreres, J., Garijo, D., González, A., Mzárquez, A., Puertas, M.L.: The determining number of Kneser graphs. Discrete Math. Theor. Comput. Sci. 15, 1–14 (2013)

    MathSciNet  Google Scholar 

  8. Cáceres, 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. Discr. Math. 21(2), 423–441 (2007)

    Article  MathSciNet  Google Scholar 

  9. Cáceres, J., Garijo, D., Puertas, M.L., Seara, C.: On the determining number and the metric dimension of graphs. Electron. J. Combin. 17, R63 (2010)

    Article  MathSciNet  Google Scholar 

  10. Cáceres, J., Hernando, C., Mora, M., Pelayo, I.M., Puertas, M.L.: On the metric dimension of infinite graphs. Discrete Appl. Math. 160, 2618–2626 (2012)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  12. Erwin, D., Harary, F.: Destroying automorphisms by fixing nodes. Discrete Math. 306, 3244–3252 (2006)

    Article  MathSciNet  Google Scholar 

  13. Fehr, M., Gosselin, S., Oellermann, O.R.: The metric dimension of Cayley digraphs. Discrete Math. 306, 31–41 (2006)

    Article  MathSciNet  Google Scholar 

  14. Feng, M., Wang, K.: On the metric dimension of bilinear forms graphs. Discrete Math. 312, 1266–1268 (2012)

    Article  MathSciNet  Google Scholar 

  15. Feng, M., Xu, M., Wang, K.: On the metric dimension of line graphs. Discrete Appl. Math. 161, 802–805 (2013)

    Article  MathSciNet  Google Scholar 

  16. Gibbons, C.R., Laison, J.D.: Fixing numbers of graphs and groups. Electron. J. Combin. 16, R39 (2009)

    Article  MathSciNet  Google Scholar 

  17. Guo, J., Wang, K., Li, F.: Metric dimension of some distance-regular graphs. J. Combin. Optim. 26, 190–197 (2013)

    Article  MathSciNet  Google Scholar 

  18. Guo, J., Wang, K., Li, F.: Metric dimension of symplectic dual polar graphs and symmetric bilinear forms graphs. Discrete Math 313, 186–188 (2013)

    Article  MathSciNet  Google Scholar 

  19. Harary, F.: Methods of destroying the symmetries of a graph. Bull. Malays. Math. Soc. 24(2), 183–191 (2001)

    MathSciNet  MATH  Google Scholar 

  20. Harary, F., Melter, R.A.: On the metric dimension of a graph. ARS Combin. 2, 191–195 (1976)

    MathSciNet  MATH  Google Scholar 

  21. Imran, M., Baig, A.Q., Bokhary, S., Javaid, I.: On the metric dimension of circulant graphs. Appl. Math. Lett. 25, 320–325 (2012)

    Article  MathSciNet  Google Scholar 

  22. Jannesari, M., Omoomi, B.: Characterization of \(n\)-vertex graphs with metric dimension \(n3\). Math. Bohem. 139, 1–23 (2014)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

We would like to give thanks to the referee for his careful reading and helpful comments, which makes our article more readable.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dein Wong.

Additional information

Publisher's Note

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

Supported by the National Natural Science Foundation of China (No.11971474).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wong, D., Zhang, Y. & Wang, Z. Graphs of Order n with Determining Number \(n{-}3\). Graphs and Combinatorics 37, 1179–1189 (2021). https://doi.org/10.1007/s00373-021-02300-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-021-02300-1

Keywords

AMS classification:

Navigation