Minimum landmark sensors for hub and spoke grids: Exact metric dimension of K1,m□K1,n

The metric dimension of a graph is the minimum number of landmark vertices required so that every vertex can be uniquely identified by its distances to the landmarks. This parameter captures the fundamental tradeoff between compact information encoding and unambiguous identification in networked systems. In this work, we determine exact value for the metric dimension of the Cartesian product $K_{1,m} \square K_{1,n}$, also known as hub-and-spoke grids, across all values of $m$ and $n$. In addition, we present a constructive linear-time algorithm that builds a minimum resolving set, providing both theoretical guarantees and practical feasibility. We complement our results with visualization of parameter regimes that illustrate the design space. The findings establish design rules for minimizing landmark sensors and support applications in graph-based localization, monitoring networks, and intelligent information systems. Our results extend the theory of metric dimension and contribute efficient methods of direct relevance to information science and computational graph theory.

Authors

Publication Details

Journal
Discrete Applied Mathematics
Published
2026-11-15
DOI
https://doi.org/10.1016/j.dam.2026.11.024
Citations
3
Primary Topic
Graph Labeling and Dimension Problems
Type
article
Field-Weighted Citation Impact
4.98
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Minimum landmark sensors for hub and spoke grids: Exact metric dimension of K1,m□K1,n

Mohsen Jannesari, Akbar Davoodi
3 citations
Discrete Applied Mathematics
Graph Labeling and Dimension Problems
4.98
article

Minimum landmark sensors for hub and spoke grids: Exact metric dimension of K1,m□K1,n

Mohsen Jannesari, Akbar Davoodi
article en
3 citations

Abstract

The metric dimension of a graph is the minimum number of landmark vertices required so that every vertex can be uniquely identified by its distances to the landmarks. This parameter captures the fundamental tradeoff between compact information encoding and unambiguous identification in networked systems. In this work, we determine exact value for the metric dimension of the Cartesian product $K_{1,m} \square K_{1,n}$, also known as hub-and-spoke grids, across all values of $m$ and $n$. In addition, we present a constructive linear-time algorithm that builds a minimum resolving set, providing both theoretical guarantees and practical feasibility. We complement our results with visualization of parameter regimes that illustrate the design space. The findings establish design rules for minimizing landmark sensors and support applications in graph-based localization, monitoring networks, and intelligent information systems. Our results extend the theory of metric dimension and contribute efficient methods of direct relevance to information science and computational graph theory.

Discrete Applied MathematicsVol. 398
Openalex Percentile: Top 7%
Graph Labeling and Dimension Problems
4.98
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon