Codes from k-resolving sets for some products
*Medha Itagi HuilgolCorresponding authormedha@bub.ernet.inDepartment of MathematicsBengaluru City UniversityBengaluru, Karnataka, IndiaView full profile → , Grace Divya D’Souzagracedivya93@gmail.comDepartment of MathematicsBengaluru City UniversityBengaluru, Karnataka, IndiaView full profile → , Ismail Naci Cangulcangul@uludag.edu.trDepartment of MathematicsBursa Uludag UniversityNilüfer, 16059, TurkeyView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 10 Jun 2024
- Published Online:
- 12 Jul 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2240
- Pages:
- 1565–1577
Abstract
Keywords
Subject Classifications
References
[1] C. Shannon, “A mathematical theory of communication”, Bell System Tech. J., vol. 27, no. 3, pp. 379–423, Jul. (1948).
[2] P. J. Cameron and J. H. van Lint, Designs, Graphs, Codes and their Links, Cambridge University Press (1991).
[3] C. Ling and C. Xing, Coding Theory, A First Course, Cambridge University Press, (2004).
[4] W. C. Huffman. and V. Pless, Fundamentals of Error Correcting Codes, Cambridge University Press (2003).
[5] A. Estrada-Moreno, J. A. Rodri’guez- Vela’zquez and I. G. Yero, “The k-metric dimension of a graph”, Applied Mathematics and Information Sciences, vol. 9, no. 6, pp. 2829-2840 (2015).
[6] A. Estrada-Moreno, I. G. Yero and J. A. Rodri’guez-Vea’zquez, “The k-metric dimension of corona product graphs”, Bulletin of the Malaysian Mathematical Sciences Society, vol. 39, no. 1, pp. 135-156 (2016).
[7] S. Klavzar, F. Rahbarnia and M. Tavakoli, “ Some binary products and integer linear programming for computing k-metric dimension of graphs”, Applied Mathematics and Computation, vol. 409, pp. 126420 (2021).
[8] A. Estrada-Moreno, I. G. Yero and J. A. Rodri’guez-Vela’zquez, “The k-metric dimension of the lexicographic product of graphs”, Discrete Mathematics, vol. 339, no. 7, pp. 1924-1934 (2016).
[9] A. Estrada-Moreno, “The k-metric dimension of a unicyclic graph”, Mathematics, vol. 9, no. 21 (2021).
[10] I. G. Yero, A. Estrada- Moreno and J. A. Rodri’quez-Vela’zquez, “Computing the k-metric dimension of graphs”, Applied Mathematics and Computation, vol. 300, no. 1, pp. 60-69 (2017).
[11] S. G. Corregidor and A. Marti’nez-Pe’rez, “A note on k-metric dimensional graphs”, Discrete Applied Mathematics, vol. 289, no. 31, pp. 523-533 (2021).
[12] R. F. Bailey and I.G. Yero, “Error-correcting codes from k-resolving sets”, Discussiones Mathematicae Graph Theory, vol. 309, pp. 4253-4265 (2009).
[13] M. I. Huilgol and G. D. D’Souza, “Codes from k-resolving sets for stacked prism graphs”, Journal of Mathematical and Computational Science, vol. 14 (2024).
[14] M. I. Huilgol and G. D. D’Souza, “Codes from k-resolving sets for some Rook’s graphs”, Journal of Systems Engineering and Electronics, vol. 34, no. 4, pp. 123-143 (2024).
[15] P. J. Slater, “Leaves of trees”, Congr. Numer., vol. 14, pp. 549-559 (1975).
[16] F. Harary and R. A. Melter, “On the metric dimension of a graph”, Ars Combin, vol. 2, pp. 191-195 (1976).
[17] M. I. Huilgol, G. D. D’Souza and I. N. Cangul, “Omega indices of strong and lexicographic products”, Current Organic Synthesis, vol. 22, no. 5, pp. 143-158 (2025).
[18] V. Lokesha, K. Z. Yasmeen and T. Deepika, “Edge version of SDD and ISI index for rooted product graphs”, Journal of Discrete and Mathematical Sciences and Cryptography, vol. 22, no. 6, pp. 1077-1090 (2019).
[19] A. D. Akwu, O. Oyewumi and D.O.A. Ajayi, “The outer-connected vertex edge domination number in cartesian product graphs”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 5, pp. 1275-1287 (May 2020).
[20] D. B. West, Introduction to Graph Theory, Second Edition, Pearson Education, Inc. (2001).
[21] J. Ca’ceres, C. Hernando, M. Mora, I. M. Pelayo, M. L. Puertas, C. Seara and D.R. Wood, “On the metric dimension of Cartesian product of graphs”, SIAM Journal on Discrete Mathematics, vol. 21, no. 2 (2007).
