Question: Indicate whether the statements below are true or false and give reason. (a) If G has the property that every edge is a cut edge,
Indicate whether the statements below are true or false and give reason.
(a) If G has the property that every edge is a cut edge, then G is a tree. (b) IfG is 3-regular and it has a perfect matching, then G has no cut-edge. (c) The minimum number of edges in a 3-connected graph on 8 vertices is 12 . (d) If G has 10 vertices and $\bar{G}$ is triangle-free, then the chromatic number of $G$ is at least 5 .
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
