Minimum 2-Tuple Dominating Set of an Interval Graph
Joint Authors
Mondal, Sukumar
Pramanik, Tarasankar
Pal, Madhumangal
Source
International Journal of Combinatorics
Issue
Vol. 2011, Issue 2011 (31 Dec. 2011), pp.1-14, 14 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2011-12-26
Country of Publication
Egypt
No. of Pages
14
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Pramanik, Tarasankar& Mondal, Sukumar& Pal, Madhumangal. 2011. Minimum 2-Tuple Dominating Set of an Interval Graph. International Journal of Combinatorics،Vol. 2011, no. 2011, pp.1-14.
https://search.emarefa.net/detail/BIM-468223
Modern Language Association (MLA)
Pramanik, Tarasankar…[et al.]. Minimum 2-Tuple Dominating Set of an Interval Graph. International Journal of Combinatorics No. 2011 (2011), pp.1-14.
https://search.emarefa.net/detail/BIM-468223
American Medical Association (AMA)
Pramanik, Tarasankar& Mondal, Sukumar& Pal, Madhumangal. Minimum 2-Tuple Dominating Set of an Interval Graph. International Journal of Combinatorics. 2011. Vol. 2011, no. 2011, pp.1-14.
https://search.emarefa.net/detail/BIM-468223
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-468223
