4 3 2 5 Fist, find the Cut Sets for all connections from the Source, S, to the T

Question

4 3 2 5 Fist, find the Cut Sets for all connections from the Source, S, to the Termination, T. For example, [1,2] is a Cut Set since if we cut, or remove 1 and 12] there is no way to connect S to T. o .Next, determine which Cut Sets are Minimum Cut Sets. For example,1,2] is also a Mininum Cut Set since if we add either ] or [2] back into the system we can reconnect S to T. o . Next, list all the Minimum Cut Sets. .What would the resulting reliability structure look like for based on the collective Minimum Cut Sets?

Explanation / Answer

Solution:

The cut-sets for the given graph are:

[1, 2], [4, 5], [1, 3, 5], [2, 3, 4], [1, 2, 3, 4], [1, 2, 3, 5]

The minimum cut sets are

[1, 2], [4, 5], [1, 3, 5], [2, 3, 4]

Based on minimum cut sets the reliability structure will look like this

{[1, 2], [4, 5]}, {[1, 3, 5], [1, 2]}, { [1, 3, 5], [2, 3, 4]}, {[1, 2], [2, 3, 4]}, {[4, 5], [1, 3, 5]}, {[4, 5], [2, 3, 4]}

If any of the given sets are available the system from S to T will always be connected.

I hope this helps if you find any problem. Please comment below. Don't forget to give a thumbs up if you liked it. :)

Related Questions

Navigate

• Browse (All)
• Browse 4
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.