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\)
Similar content being viewed by others
References
Albertson, M.O., Boutin, D.L.: Using determining sets to distinguish Kneser graphs. Electron. J. Combin. 14(1), R20 (2007)
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)
Bailey, R.F., Meagher, K.: On the metric dimension of Grassmann graphs. Discrete Math. Theor. Comput. Sci. 13, 97–104 (2011)
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)
Boutin, D.L.: Identifying graphs automorphisms using determining sets. Electron. J. Combin. R13(1), 78 (2006)
Boutin, D.L.: The determining number of a Cartesian product. J. Graph Theory 61(2), 77–87 (2009)
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)
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)
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)
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)
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)
Erwin, D., Harary, F.: Destroying automorphisms by fixing nodes. Discrete Math. 306, 3244–3252 (2006)
Fehr, M., Gosselin, S., Oellermann, O.R.: The metric dimension of Cayley digraphs. Discrete Math. 306, 31–41 (2006)
Feng, M., Wang, K.: On the metric dimension of bilinear forms graphs. Discrete Math. 312, 1266–1268 (2012)
Feng, M., Xu, M., Wang, K.: On the metric dimension of line graphs. Discrete Appl. Math. 161, 802–805 (2013)
Gibbons, C.R., Laison, J.D.: Fixing numbers of graphs and groups. Electron. J. Combin. 16, R39 (2009)
Guo, J., Wang, K., Li, F.: Metric dimension of some distance-regular graphs. J. Combin. Optim. 26, 190–197 (2013)
Guo, J., Wang, K., Li, F.: Metric dimension of symplectic dual polar graphs and symmetric bilinear forms graphs. Discrete Math 313, 186–188 (2013)
Harary, F.: Methods of destroying the symmetries of a graph. Bull. Malays. Math. Soc. 24(2), 183–191 (2001)
Harary, F., Melter, R.A.: On the metric dimension of a graph. ARS Combin. 2, 191–195 (1976)
Imran, M., Baig, A.Q., Bokhary, S., Javaid, I.: On the metric dimension of circulant graphs. Appl. Math. Lett. 25, 320–325 (2012)
Jannesari, M., Omoomi, B.: Characterization of \(n\)-vertex graphs with metric dimension \(n3\). Math. Bohem. 139, 1–23 (2014)
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
Corresponding author
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
About this article
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
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-021-02300-1