BIKASH DAS

Roll no:-106
Spanning tree
Spanning Tree:-
 A spanning tree is a subset of graph(G), which has all
the vertices covered with minimum possible number of
edges. Hence, a spanning tree does not have cycles
and it cannot be disconnected..
 A

C B
(a)Graph G

Spanning tree

A A

C B C B C B
General Properties:-
 A connected graph G can have more
than one spanning tree.
 All possible spanning trees of graph (g),
have the same number of edge and
vertices.
 The spanning tree does not have any
loops.
 Disconnected graph do not have
spanning trees.
Finding a Spanning Tree
Find a spanning tree for the graph below.

We could break the two cycles by removing a single edge from each.
One of several possible ways to do this is shown below.

Was breadth-first or
depth-first search (or
neither) used to
create this?
Minimum Spanning Tree
 In a weighted graph, a minimum spanning tree is a
spanning tree that has minimum weighted than all
other spanning trees of the same graph.
Minimum Spanning Tree

 Minimum-cost spanning trees have many

applications.
 Building cable networks that join n locations
with minimum cost.
 Building a road network that joins n cities with
minimum cost.
 Obtaining an independent set of circuit
equations for an electrical network.
 In pattern recognition minimal spanning trees
can be used to find noisy pixels.
Minimum Spanning Tree

 Consider this graph.

 It has 20 spanning trees. Some are:

 There are two minimum-

cost spanning trees,
each with a cost of 6: