Graph Algorithms

One or more correct

• AThere are no back-edges in $G$ with respect to the tree $T$
• BThere are no cross-edges in $G$ with respect to the tree $T$
• CThere are no forward-edges in $G$ with respect to the tree $T$
• DThe only edges in $G$ are the edges in $T$

Numerical answer

One or more correct

• AAll edges in $G$ have even weight
• BAll edges in $G$ have even weight OR all edges in $G$ have odd weight
• CIn each cycle $C$ in $G$, all edges in $C$ have even weight
• DIn each cycle $C$ in $G$, either all edges in $C$ have even weight OR all edges in $C$ have odd weight

Numerical answer