A bridge between the minimal doubly resolving set problem in (folded) hypercubes and the coin weighing problem

In this paper, we consider the minimal doubly resolving set problem in Hamming graphs, hypercubes and folded hypercubes. We prove that the minimal doubly resolving set problem in hypercubes is equivalent to the coin weighing problem. Then we answer an open question on the minimal doubly resolving se...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Discrete Applied Mathematics 2022-03, Vol.309, p.147-159
Hauptverfasser:	Lu, Changhong, Ye, Qingjie
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Codes Coin weighing problem Doubly resolving set Graphs Hamming graph Hypercube Hypercubes Metric dimension Upper bounds Weighing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!