Domination in Kn\"odel Graphs
Given a graph and an integer $k$, it is an NP-complete problem to decide whether there is a dominating set of size at most $k$. In this paper we study this problem for the Kn\"odel Graph on $n$ vertices using elementary number theory techniques. In particular, we show an explicit upper bound fo...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2022-05-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/7158/pdf |