Graphic theory

T5: (a) Find the minimum spanning tree in each of the graphs below using Kruskal's algorithm.

(b) Let G be a graph that is the union of a 2010-cycle and a 2011-cycle, with one common edge. Count the number of spanning tree of G.

T5: (a) Find the minimum spanning in each the graphs below using Krus algorithm. tree of (b) Let G be a graph that is the union of a 20 cycle and a 201-cycle with common edge. Count the number of spanning trees of G