Codes from k-resolving sets for some products
Journal of Discrete Mathematical Sciences and Cryptography, vol.29, no.4, pp.1565-1577, 2026 (ESCI, Scopus)
- Publication Type: Article / Article
- Volume: 29 Issue: 4
- Publication Date: 2026
- Doi Number: 10.47974/jdmsc-2240
- Journal Name: Journal of Discrete Mathematical Sciences and Cryptography
- Journal Indexes: Emerging Sources Citation Index (ESCI), Scopus, zbMATH
- Page Numbers: pp.1565-1577
- Keywords: Cartesian product, Codes, k-metric basis, k-resolving, Strong product
- Bursa Uludag University Affiliated: Yes
Abstract
In this paper, codes for Cartesian product of graphs such as Kt ◻ Ps and strong product of graphs such as Kt ⌧ Ps using k-resolving sets are determined. We also obtain infinite families of Kt ◻ Ps and Kt ⌧ Ps of k-dimension. Also, the k-metric dimension of Kt ◻ Ps and Kt ⌧ is studied, an exact formula for their dimensions is determined and the codes are obtained.