Suppose interstate highways join the six towns A, B, C, D,E,F as follows: 1-77 goes from B through A to 1-82 goes from C through
D then through B to F: 1-85 goes from D through A to F; 1-90 goes from C through E to F and 1-91 goes from D to E.
a) Draw a graph of the network with vertices for towns and edges for segments of interstates linking neighboring towns. b) What is the minimum number of edges whose removal prevents travel between some pair of towns?
c) Is it possible to take a trip starting from town C that goes to every town without using any interstate highway for more than one edge (the trip need not return to C?
a) Draw a graph of the network with vertices for towns and edges for segments of interstates linking neighboring towns. b) What is the minimum number of edges whose removal prevents travel between some pair of towns?
c) Is it possible to take a trip starting from town C that goes to every town without using any interstate highway for more than one edge (the trip need not return to C?
1 answer:
You might be interested in
Domain is the entire span left to right (on the x-axis) that the graph is on. Since the graph goes from x=-4 and ends at x=4, the domain would be from -4 to 4. The circle at -4 is open, so it does not include the point at -4, just everything leading up to it. So, the domain would be
The range is similar, it is the entire span that the graph goes up and down (on the y-axis). The graph starts at the bottom at y=-2, and ends at y=5. The bottom point (4,-2) is closed, so the graph includes that point, and the top point (-4,5) is open and doesn't include the point. Therefore, the range would be