Search results for: domination number

• Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks

  Publication

  • J. Raczek

  - Electronics - Year 2022

  Dominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...

  Full text available to download