Muhammad Fazil, Imran Javaid, Muhammad Salman, Usman Ali
Published 2014-09-02Version 1
A hypergraph is a generalization of a graph where edges can connect any number of vertices. In this paper, we extend the study of locating-dominating sets to hypergraphs. Along with some basic results, sharp bounds for the location-domination number of hypergraphs in general and exact values with specified conditions are investigated. Moreover, locating-dominating sets in some specific hypergraphs are found.
Comments: 12 pages, 0figure
Distance-$k$ locating-dominating sets in graphs
Locating-Dominating Sets and Identifying Codes of a Graph Associated to a Finite Vector Space
On (t,r) Broadcast Domination Numbers of Grids
![QR code for arXiv:1409.0662 [math.CO]](http://oss.arxitics.com/images/favicon.svg)