3 problems

Let $KG_n$ be the Knödel graph on even $n$ vertices, let $m=\lfloor\log n\rfloor$, and let $\gamma(KG_n)$ denote its domination number. The near-trivial-bound conjecture. … The low…

Let $KG_n$ be the Knödel graph on even $n$ vertices, and let $\gamma(KG_n)$ denote its domination number. Let $p$ be an odd prime and let $k\geq2$ be an integer. Suppose that…

Let $KG_n$ be the Knödel graph on even $n$ vertices, and let $gamma(KG_n)$ denote its domination number. Let $p$ be an odd prime with $p\leq\lceil\log n\rceil$, and suppose that…