Digital repository of Slovenian research organisations

Show document
A+ | A- | Help | SLO | ENG

Title:On the weak $k$-metric dimension of Hamming graphs
Authors:ID Fernández, Elena (Author)
ID Klavžar, Sandi (Author)
ID Kuziak, Dorota (Author)
ID Muñoz-Márquez, Manuel (Author)
ID Yero, Ismael G. (Author)
Files:.pdf PDF - Presentation file, download (967,09 KB)
MD5: B763044489102E3BF1A567EDEFD8DE93
 
URL URL - Source URL, visit https://www.sciencedirect.com/science/article/pii/S1572528626000186
 
Language:English
Typology:1.01 - Original Scientific Article
Organization:Logo IMFM - Institute of Mathematics, Physics, and Mechanics
Abstract:Given a connected graph $G$, a set of vertices $X\subset V(G)$ is a weak $k$-resolving set of $G$ if for each two vertices $y,z\in V(G)$, the sum of the values $|d_G(y,x)-d_G(z,x)|$ over all $x\in X$ is at least $k$, where $d_G(u,v)$ stands for the length of a shortest path between $u$ and $v$. The cardinality of a smallest weak $k$-resolving set of $G$ is the weak $k$-metric dimension of $G$, and is denoted by $\mathrm{wdim}_k(G)$. In this paper, $\mathrm{wdim}_k(K_n\,\square\,K_n)$ is determined for every $n\ge 3$ and every $2\le k\le 2n$. An improvement of a known integer linear programming formulation for this problem is developed and implemented for the graphs $K_n\,\square\,K_m$. Conjectures regarding these general situations are posed.
Keywords:weak $k$-metric dimension, weak $k$-resolving set, Cartesian product, Hamming graph
Publication status:Published
Publication version:Version of Record
Publication date:01.05.2026
Year of publishing:2026
Number of pages:12 str.
Numbering:Vol. 60, article no. 100945
PID:20.500.12556/DiRROS-28314 New window
UDC:519.17:519.8
ISSN on article:1572-5286
DOI:10.1016/j.disopt.2026.100945 New window
COBISS.SI-ID:271637763 New window
Publication date in DiRROS:13.03.2026
Views:216
Downloads:169
Metadata:XML DC-XML DC-RDF
:
Copy citation
  
Share:Bookmark and Share


Hover the mouse pointer over a document title to show the abstract or click on the title to get all document metadata.

Record is a part of a journal

Title:Discrete optimization
Publisher:Elsevier
ISSN:1572-5286
COBISS.SI-ID:513620761 New window

Document is financed by a project

Funder:Spanish Ministry of Science and Innovation
Project number:PID2023-146643NB-I00

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:P1-0297
Name:Teorija grafov

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0285
Name:Metrični problemi v grafih in hipergrafih

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0355
Name:Prirejanja, transverzale in hipergrafi

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:N1-0431
Name:Dominacija v grafih: kubični grafi, produkti in igre

Funder:ARIS - Slovenian Research and Innovation Agency
Project number:J1-70045
Name:Splošna lega in vidnost v teoriji grafov

Funder:Ministerio de Educación, Cultura y Deporte
Funding programme:‘‘José Castillejo’’ program for young researchers
Project number:CAS22/00081

Licences

License:CC BY 4.0, Creative Commons Attribution 4.0 International
Link:http://creativecommons.org/licenses/by/4.0/
Description:This is the standard Creative Commons license that gives others maximum freedom to do what they want with the work as long as they credit the author.

Secondary language

Language:Slovenian
Keywords:šibka $k$-metrična dimenzija, šibka $k$-solventna množica, kartezični produkt, Hammingov graf


Back