Abstract
Let G =(V, E) be a graph and k be a fixed positive integer. A distance k-dominating set in a graph G, is a set of vertices D in V such that every vertex in V\\D is at distance at most k from some vertex in D. The minimum cardinality distance k-dominating set in G is the distance k-domination number γk. The distance k-domination problem is to find a γk in G. This problem generalizes the dominating set problem, a central problem in theoretical computer science and is therefore NP-complete for general graphs. The main result of this paper is a better time bound for distance k-domination on permutation graphs by exploiting the structure of permutation in a direct way.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
