At coder test doubt

#1

Pease help me to solve this question ,I am facing doubt regarding this question.

#2

hello @Somasree

consider following points->

  1. For a tree (G) if we know the set of odd degree vertices in our subgraph(H) , there is unique way to select edges for H

  2. Above thing can be expanded to any “connected” graph , by first selecting ANY subset of back edges and then select the UNIQUE subgraph in the remaining DFS tree.

  3. Given a connected graph there are {n}choose{k} * (2^{back_edges}) ways to select a subgraph with k odd degree vertices .

  4. Combining DP for connected components can give you the result for the whole graph G .

#3

image
Please help me in solving this problem

#4

@Somasree

pls share the clear image of the question. … . . .

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.