The graph in figure 1 is a sales network, where • s represents a factory producing pop-its, t is the local school, other vertices (af) are agents onselling pop-its. edges represent sales connections A radical group wants to stop pop-its reaching the local school by disrupting sales. factory 8 b с f Figure 1: Graph to disconnect School (a) What is the minimum number of connections whose deletion would stop pop-its reaching the local school? 2 (b) A marketing expert claims that network is 3-edge connected between s and t, explain why they are mistaken. only takes two edge deletion to cut off the school from factery, it can not be 3-edge connected. sina it (c) We can translate the network into a flow network by attaching directions to each edge. (i) If we ignore that we wants to be the source and t to be the sink, then how many orientations can we put on the graph? every edge can have. two directions so ze=24 (ii) We do wants to be the source and t to be the sink of a flow network. How many flow networks can we setup?
The graph in figure 1 is a sales network, where • s represents a factory producing pop-its, t is the local school, other vertices (af) are agents onselling pop-its. edges represent sales connections A radical group wants to stop pop-its reaching the local school by disrupting sales. factory 8 b с f Figure 1: Graph to disconnect School (a) What is the minimum number of connections whose deletion would stop pop-its reaching the local school? 2 (b) A marketing expert claims that network is 3-edge connected between s and t, explain why they are mistaken. only takes two edge deletion to cut off the school from factery, it can not be 3-edge connected. sina it (c) We can translate the network into a flow network by attaching directions to each edge. (i) If we ignore that we wants to be the source and t to be the sink, then how many orientations can we put on the graph? every edge can have. two directions so ze=24 (ii) We do wants to be the source and t to be the sink of a flow network. How many flow networks can we setup?
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
can someone please help me with these questions? I tried solving them but it seems too trivial so I'm pretty sure that I'm doing something wrong
Transcribed Image Text:The graph in figure 1 is a sales network, where
● s represents a factory producing pop-its,
•t is the local school,
• other vertices (af) are agents onselling pop-its.
edges represent sales connections
A radical group wants to stop pop-its reaching the local school by disrupting sales.
factory
a
b
d
e
f
Figure 1: Graph to disconnect
School
(a) What is the minimum number of connections whose deletion would stop pop-its reaching
the local school? 2
(b) A marketing expert claims that network is 3-edge connected between s and t, explain why
they are mistaken. since it only takes two edge deletion to cut off the school
from factery, it can not be 3-edge connected.
(c) We can translate the network into a flow network by attaching directions to each edge.
(i) If we ignore that we wants to be the source and t to be the sink, then how many
orientations can we put on the graph? every edge can have.
two directions so ze=24
(ii) We do wants to be the source and t to be the sink of a flow network. How many
flow networks can we setup?
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 4 steps with 32 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
