Domination in Knödel graphs
Given a graph G and an integer k, it is an NP-complete problem to decide whether G has a dominating set of size at most k. In this paper we study this problem for the Knödel Graph on n vertices using elementary number theory techniques. In particular, we show an explicit upper bound for the dominat...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics and Theoretical Computer Science
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |