The problem is very vaguely phrased, but reverse engineering from the solution:
Suppose there is a block of $3$ specific boys that must be sat together, call this block $X$ and say it consists of $B_1, B_2, B_3$. Then we must sit $G_1, G_2, G_3, G_4, B_4, X$, for which there are $6!$ possible arrangements. If we wish to disregard rotations, let's say that $G_1$ must always sit at the head of the table, so there are then $5!$ ways to arrange them. Now, $X$ can itself be sorted in $3!$ ways, so that makes the total $5!\times 3!$
To summarize: One interpretation of the question that matches the official result is "how many ways are there to place $4$ boys and $4$ girls at a round table given that there is a specified group of $3$ boys who must be seated in a block and given that arrangements that differ by a rotation are equivalent?"
Of course, different interpretations of the question will lead to different results.