Koch-Narayan Conjecture 1

For a bipartite graph without isolated vertices and with a unique minimum dominating set, does the proposed function $m(n, \gamma)$ bound the number of edges whenever $\gamma \ge 2$ and $n \ge 3\gamma$? A $13$-vertex bipartite graph with $22$ edges exceeds the conjectured maximum of $21$.