Locating-Dominating sets in Hypergraphs
Combinatorics
2014-09-03 v1
Abstract
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.
Cite
@article{arxiv.1409.0662,
title = {Locating-Dominating sets in Hypergraphs},
author = {Muhammad Fazil and Imran Javaid and Muhammad Salman and Usman Ali},
journal= {arXiv preprint arXiv:1409.0662},
year = {2014}
}
Comments
12 pages, 0figure