# vijaym123/K-walk-dominating-set

> A dominating set for a graph G = (V, E) is a subset D of V, where the set can be reached from any other vertices in less than or equal  k steps with a probability involved is greater than half.

- **Canonical URL**: https://githubrepo.cloud/repo/vijaym123/K-walk-dominating-set
- **GitHub Repository**: https://github.com/vijaym123/K-walk-dominating-set
- **Maintainer / Creator**: https://github.com/vijaym123
- **Discovered On**: Sep 25, 2026

---
*Indexed by GitHubRepo (https://githubrepo.cloud). Real-time open-source discovery & telemetry.*