Let g be a connected graph on n vertices. (a) show that any connected subgraph of g on n vertices contains a spanning tree of g. (b) use this to show that if a set s has an edge in common with every spanning tree of g, then it contains a cutset.

10 b/c 5*2 =10

step-by-step explanation:

70.30

step-by-step explanation:

5

step-by-step explanation:

180°

step-by-step explanation:

sum of equilateral triangle=180°

< n=60°

< m=120°°[angle supplementary of equilateral angle]

< m+< r+< x=360°(sum of exterior angle of triangle)