Codes from k-resolving sets for some products


Huilgol M. I., D’souza G. D., CANGÜL İ. N.

Journal of Discrete Mathematical Sciences and Cryptography, cilt.29, sa.4, ss.1565-1577, 2026 (ESCI, Scopus)

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 29 Sayı: 4
  • Basım Tarihi: 2026
  • Doi Numarası: 10.47974/jdmsc-2240
  • Dergi Adı: Journal of Discrete Mathematical Sciences and Cryptography
  • Derginin Tarandığı İndeksler: Emerging Sources Citation Index (ESCI), Scopus, zbMATH
  • Sayfa Sayıları: ss.1565-1577
  • Anahtar Kelimeler: Cartesian product, Codes, k-metric basis, k-resolving, Strong product
  • Bursa Uludağ Üniversitesi Adresli: Evet

Özet

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.