Correct answer: Both P and Q
In undirected graphs, the sum of the degrees of all vertices is always even because each edge contributes two to the total degree count. Additionally, the number of vertices with odd degrees must be even due to the Handshaking Lemma, which states that the sum of the degrees of all vertices is equal to twice the number of edges.