Book ChapterDOI
Domination Parameters in Hypertrees
R. Jayagopal,Indra Rajasingh,R. Sundara Rajan +2 more
- pp 299-307
TLDR
The domination, total domination, locating-domination and locating-total domination numbers for hypertrees are determined.Abstract:
A locating-dominating set LDS S of a graph G is a dominating set S of G such that for every two vertices u and v in $$VG \setminus S$$, $$Nu\cap S \ne Nv\cap S$$. The locating-domination number $$\gamma ^{L}G$$ is the minimum cardinality of a LDS of G. Further if S is a total dominating set then S is called a locating-total dominating set. In this paper we determine the domination, total domination, locating-domination and locating-total domination numbers for hypertrees.read more
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
Towards a theory of domination in graphs
TL;DR: The domatic number of a graph is defined and studied and it is seen that the theory of domination resembles the well known theory of colorings of graphs.