Okay, I'll talk you through why each statement is false.
The first statement: In the network, there could be three vertices with odd degrees.
This is false, as this condition renders the network disconnected, and therefore an Euler path/circuit can not exist.
The second statement: The path could have passed an isolated vertex. Once again this just makes no sense.
The third statement: The path could have included vertex Q more than once. I drew a sample network and was able to show that it could pass Q more than once, although after some experience with Euler paths/circuits it should be known that this is true.
The fourth statement: The sum of the degrees of P and Q could equal seven. This is false as for an Euler path to exist, P and Q must either both be even or odd vertices. And in any case, the sum of two odd numbers and two even numbers is always an even number and therefore not 7.
The fifth statement: The sum of degrees of all the vertices in the network could be equal to seven. This is false for the same reason as the statement above is false. For example, if P and Q are even vertices, then summing even numbers will always yield an even number. If we consider the alternative case, P and Q are both odd vertices, then summing two odds makes an even, and then summing evens will still yield an even.
Hence, the only statement that is true is actually the third statement, and so the answer is B.
I hope this helped
