Q 3 The graph in figure 1 is a sales network, where • s represents a factory producing pop-its, ⚫t is the local school, - • other vertices (a – f) are agents onselling pop-its. edges represent sales connections S t A radical group wants to stop pop-its reaching the local school by disrupting sales. f Figure 1: Graph to disconnect (a) What is the minimum number of connections whose deletion would stop pop-its reaching the local school? (b) A marketing expert claims that network is 3-edge connected between s and t, explain why they are mistaken. (c) We can translate the network into a network by attaching directions to each edge. (i) If we ignore that we want s to be the source and t to be the sink, then how many orientations can we put on the graph? (ii) We do wants to be the source and t to be the sink of a network. How many networks can we setup? (iii) For the network in figure 2 (with the given intial flow), use Ford-Fulkerson to show it is a maximum flow, identify the min-cut, and explain why this result implies the original graph is at least 2-edge connected from s to t. 1,1 a d 1,1 1,0 1,0 1,1 1,1 1,1 S b t 1,1 1,0 1,0 с f 1,1 Figure 2: Graph with flow

Q 3 The graph in figure 1 is a sales network, where • s represents a factory producing pop-its, ⚫t is the local school, - • other vertices (a – f) are agents onselling pop-its. edges represent sales connections S t A radical group wants to stop pop-its reaching the local school by disrupting sales. f Figure 1: Graph to disconnect (a) What is the minimum number of connections whose deletion would stop pop-its reaching the local school? (b) A marketing expert claims that network is 3-edge connected between s and t, explain why they are mistaken. (c) We can translate the network into a network by attaching directions to each edge. (i) If we ignore that we want s to be the source and t to be the sink, then how many orientations can we put on the graph? (ii) We do wants to be the source and t to be the sink of a network. How many networks can we setup? (iii) For the network in figure 2 (with the given intial flow), use Ford-Fulkerson to show it is a maximum flow, identify the min-cut, and explain why this result implies the original graph is at least 2-edge connected from s to t. 1,1 a d 1,1 1,0 1,0 1,1 1,1 1,1 S b t 1,1 1,0 1,0 с f 1,1 Figure 2: Graph with flow

Advanced Engineering Mathematics

10th Edition

ISBN:9780470458365

Author:Erwin Kreyszig

Publisher:Erwin Kreyszig

Chapter2: Second-order Linear Odes

Section: Chapter Questions

Problem 1RQ

See similar textbooks

Similar questions

I need help please (Not honor class) (Not grading)
Find area
Help
TRY: Computt the S.D. and raund aff to a decimal placee Age = 4,4.6,6.7. 3} senting
Please answer Item Number 2.
1. Find the shaded areas. -2.39 -1.81 -0.92 2.03
Please help me answer the following questions. Thank you