Locating-dominating sets in hypergraphs (Q1677551)

The authors define locating-dominating sets in hypergraphs. The definition is a direct generalization of locating-dominating sets in graphs. The location-dominating number \( \lambda (G)\) is defined as the cardinality of a minimal locating-dominating set. Sharp bounds for \(\lambda (G)\) for general hypergraphs are presented. Exact values of \(\lambda(G)\) are found for some special classes of \(k\)-uniform hypergraphs, such as linear hypergraphs, hyperpaths, and hypercycles.