Solution Found!
Consider the network shown in Fig. 33. (a) How many different spanning trees does this
Chapter 7, Problem 30(choose chapter or problem)
Consider the network shown in Fig. 33. (a) How many different spanning trees does this network have? (b) Find a spanning tree that has the largest degree of separation between H and J. (c) Find a spanning tree that has the smallest degree of separation between K and G.
Questions & Answers
QUESTION:
Consider the network shown in Fig. 33. (a) How many different spanning trees does this network have? (b) Find a spanning tree that has the largest degree of separation between H and J. (c) Find a spanning tree that has the smallest degree of separation between K and G.
ANSWER:Step 1 of 4
(a) The network has
vertices
edges.
The redundancy of the network is
Hence to find a spanning tree we will have to "discard" two edges. Four of these edges are bridges of the network, and they will have to be part of any spanning tree.