Peer-Reviewed Article December 25, 2011
Minimum 2-Tuple Dominating Set of an Interval Graph
Are you an author of this work?Link to your sovereign AfriScholar profile
Published in: International Journal of Combinatorics
Publisher: Hindawi Publishing Corporation • Egypt • 1687-9163
Abstract
The k -tuple domination problem, for a fixed positive integer k , is to find a minimum size vertex subset such that every vertex in the graph is dominated by at least k vertices in this set. The case when k=2 is called 2-tuple domination problem or double domination problem. In this paper, the 2-tuple domination problem is studied on interval graphs from an algorithmic point of view, which takes O(n2) time, n is the total number of vertices of the interval graph.
