In this case, any one of the vertices can dominate the other, so the domination number is 1, which is equal to $\lfloor 2/2 \rfloor = 1$.
For $n=3$, we have a path of length 2 connecting three vertices. In this case, the middle vertex can dominate the other two,
Show more…