On the metric dimension of cartesian products of graphs

SIAM Journal on Discrete Mathematics

Volumn 21, Issue 2, 2007, Pages 423-441

  Cáceres, José ^a   Hernando, Carmen ^b   Mora, Mergè ^b   Pelayo, Ignacio M ^b   Puertas, María L ^a   Seara, Carlos ^b   Wood, David R ^b  

^a UNIVERSITY OF ALMERÍA   (Spain)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Cartesian product; Coin weighing; Distance; Djokovi ; Graph; Hamming graph; Mastermind; Metric basis; Metric dimension; Resolving set; Winkler relation

Indexed keywords

GRAPH THEORY;

APPLIED MATHEMATICS; CARDINALITY; CARTESIAN PRODUCTS; CARTESIAN PRODUCTS OF GRAPHS; GRAPH G; MINIMUM ORDER; OF GRAPHS;

SET THEORY;

EID: 38149005958     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/050641867     Document Type: Article

References (48)

1. N. ALON, D. N. KOZLOV, AND V. H. VU, The geometry of coin-weighing problems, in Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS '96), IEEE, 1996, pp. 524-532.
2. Z. BEERLIOVA, F. EBERHARD, T. ERLEBACH, A. HALL, M. HOFFMANN, M. MIHALAK, AND L. S. RAM, Network discovery and verification, in Proceedings of the 31st Workshop on Graph Theoretic Concepts in Computer Science (WG '05), Lecture Notes in Comput. Sci. 3787, D. Kratsch, ed., Springer, Berlin, 2005, pp. 127-138.
3. A. BOGOMOLNY AND D. GREENWELL, Cut the Knot: Invitation to Mastermind, http://www.maa.org/editorial/knot/ Mastermind.html (1999).
4. R. C. BRIGHAM, G. CHARTRAND, R. D. DUTTON, AND P. ZHANG, Resolving domination in graphs, Math. Bohem., 128 (2003), pp. 25-36.
5. P. S. BUCZKOWSKI, G. CHARTRAND, C. POISSON, AND P. ZHANG, On k-dimensional graphs and their bases, Period. Math. Hungar., 46 (2003), pp. 9-15.
6. D. G. CANTOR, Determining a set from the cardinalities of its intersections with other sets, Ganad. J. Math., 16 (1964), pp. 94-97.
7. D. G. CANTOR AND W. H. MILLS, Determination of a subset from certain combinatorial properties, Canad. J. Math., 18 (1966), pp. 42-48.
8. G. G. CHAPPELL, J. GIMBEL, AND C. HARTMAN, Bounds on the Metric and Partition Dimensions of a Graph, http://www.cs.uaf.edu/∼chappell/papers/metric/ (2003).
9. G. CHARTRAND, L. EROH, M. A. JOHNSON, AND O. R. OELLERMANN, Resolvability in graphs and the metric dimension of a graph, Discrete Appl. Math., 105 (2000), pp. 99-113.
10. G. CHARTRAND, C. POISSON, AND P. ZHANG, Resolvability and the upper dimension of graphs, Comput. Math. Appl., 39 (12) (2000), pp. 19-28.
11. G. CHARTRAND AND P. ZHANG, The forcing dimension of a graph, Math. Bohem., 126 (2001), pp. 711-720.
12. G. CHARTRAND AND P. ZHANG, The theory and applications of resolvability in graphs. A survey, in Proceedings of the 34th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Congr. Numer., 160 (2003), pp. 47-68.
13. V. CHVÁTAL, Mastermind, Combinatorica, 3 (1983), pp. 325-329.
14. J. CURRIE AND O. R. OELLERMANN, The metric dimension and metric independence of a graph, J. Combin. Math. Combin. Comput., 39 (2001), pp. 157-167.
15. D. Ž. DJOKOVIĆ, Distance-preserving subgraphs of hypercubes, J. Combin. Theory Ser. B, 14 (1973), pp. 263-267.
16. P. ERDÓ́S AND A. RÉNYI, On two problems of information theory, Magyar Tud. Akad. Mat. Kutató Int. Közl., 8 (1963), pp. 229-243.
17. M. FEHR, S. GOSSELIN, AND O. R. OELLERMANN, The metric dimension of Cayley digraphs, Discrete Math., 306 (2006), pp. 31-41.
18. M. FEHR, S. GOSSELIN, AND O. R. OELLERMANN, The partition dimension of Cayley digraphs, Aequationes Math., 71 (2006), pp. 1-18.
19. P. FRANK AND R. SILVERMAN, Remarks on detection problems, Amer. Math. Monthly, 74 (1967), pp. 171-173.
20. W. GODDARD, Static mastermind, J. Combin. Math. Combin. Comput., 47 (2003), pp. 225-236.
21. W. GODDARD, Mastermind revisited, J. Combin. Math. Combin. Comput., 51 (2004), pp. 215-220.
22. D. L. GREENWELL, Mastermind, J. Recr. Math., 30 (1999-2000), pp. 191-192.
23. R. K. GUY AND R. J. NOWAKOWSKI, Coin-weighing problems, Amer. Math. Monthly, 102 (1995), p. 164.
24. F. HARARY AND R. A. MELTER, On the metric dimension of a graph, Ars Combin., 2 (1976), pp. 191-195.
25. W. IMRICH AND S. KLAVŽAR, Product Graphs, Wiley, New York, 2000.
26. G. KABATIANSKI, V. S. LEBEDEV, AND J. THORPE, The Mastermind game and the rigidity of Hamming spaces, in Proceedings of the IEEE International Symposium on Information Theory (ISIT '00), IEEE, 2000, p. 375.
27. S. KHULLER, B. RAGHAVACHARI, AND A. ROSENFELD, Landmarks in graphs, Discrete Appl. Math., 70 (1996), pp. 217-229.
28. D. E. KNUTH, The computer as master mind, J. Recr. Math., 9 (1976/1977), pp. 1-6.
29. B. LINDSTRÖM, On a combinatory detection problem. I, Magyar Tud. Akad. Mat. Kutató Int. Közl., 9 (1964), pp. 195-207.
30. B. LINDSTRÖM, On a combinatorial problem in number theory, Canad. Math. Bull., 8 (1965), pp. 477-490.
31. B. LINDSTRÖM, On a combinatory detection problem. II, Studia Sci. Math. Hungar., 1 (1966), pp. 353-361.
32. W. H. MOW, Multiuser coding based on detecting matrices for synchronous-CDMA systems, in Proceedings of the Cryptography and Coding, Lecture Notes in Comput. Sci. 1355, Springer, Berlin, 1997, pp. 251-257.
33. J. PETERS-FRANSEN AND O. R. OELLERMANN, The metric dimension of the cartesian product of graphs, Utilitas Math., 69 (2006), pp. 33-41.
34. N. PIPPENGER, An information-theoretic method in combinatorial theory, J. Combin. Theory Ser. A, 23 (1977), pp. 99-104.
35. C. POISSON AND P. ZHANG, The metric dimension of unicyclic graphs, J. Combin. Math. Combin. Comput., 40 (2002), pp. 17-32.
36. V. SAENPHOLPHAT AND P. ZHANG, Connected resolvability of graphs, Czechoslovak Math. J., 53 (2003), pp. 827-840.
37. V. SAENPHOLPHAT AND P. ZHANG, Conditional resolvability in graphs: A survey, Int. J. Math. Math. Sci., 37-40 (2004), pp. 1997-2017.
38. V. SAENPHOLPHAT AND P. ZHANG, Detour resolvability of graphs, in Proceedings of the 35th Southeastern International Conference on Combinatorics, Graph Theory and Computing, Congr. Numer., 169 (2004), pp. 3-21.
39. V. SAENPHOLPHAT AND P. ZHANG, On connected resolving decompositions in graphs, Czechoslovak Math. J., 54 (2004), pp. 681-696.
40. A. SEBÓ́ AND E. TANNIER, On metric generators of graphs, Math. Oper. Res., 29 (2004), pp. 383-393.
41. B. SHANMUKHA, B. SOORYANARAYANA, AND K. S. HARINATH, Metric dimension of wheels, Far East J. Appl. Math., 8 (2002), pp. 217-229.
42. P. J. SLATER, Leaves of trees, in Proceedings of the 6th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congr. Numer., 14 (1975), pp. 549-559.
43. P. J. SLATER, Dominating and reference sets in a graph, J. Math. Phys. Sci., 22 (1988), pp. 445-455.
44. S. SÖDERBERG AND H. S. SHAPIRO, A combinatory detection problem, Amer. Math. Monthly, 70 (1963), p. 1066.
45. B. SOORYANARAYANA, On the metric dimension of a graph, Indian J. Pure Appl. Math., 29 (1998), pp. 413-415.
46. B. SOORYANARAYANA AND B. SHANMUKHA, A note on metric dimension, Far East J. Appl. Math., 5 (2001), pp. 331-339.
47. P. M. WINKLER, Isometric embedding in products of complete graphs, Discrete Appl. Math., 7 (1984), pp. 221-225.
48. S. V. YUSHMANOV, Estimates for the metric dimension of a graph in terms of the diameters and the number of vertices, Vestnik Moskov. Univ. Ser. I Mat. Mekh., 103 (1987), pp. 68-70.