New telephone lines must be installed to connect 8 cities (A, B, C, D, E, F, G, and H). Due to government regulations, the only possible connections that are allowed are shown by the edges on the network below. The numbers on the edges indicate the cost (in millions of dollars) of each possible connection. The telephone company wishes to connect the cities in the cheapest possible way.
The degree of vertex E in the minimal spanning tree is
A. 1.
B. 3.
C. 4.
D. 2.
E. all of these will be directly connected.
Answer: B
You might also like to view...
Match the graph with its corresponding function.
A. g(x) = 0.25|x + 6| - 3 B. g(x) = 3|x - 6| + 0.25 C. g(x) = 0.25|x - 6| + 3 D. g(x) = 3|x + 6| - 0.25
Solve the difference equation and, by inspection, determine the long-run behavior of the terms (i.e., the behavior of the terms as n gets large).yn = 6yn-1 - 45, y0 = 13
A. yn = 9 + 6(4)n; yn approaches 6. B. yn = 9 + 4(6)n; yn gets arbitrarily large and positive. C. yn = 9 - 4(6)n; yn gets arbitrarily large and negative. D. yn = 9 + 13(6)n; yn approaches 9.
Write in words, as on a check.$99.99
A. Ninety-nine and 
dollars
B. Ninety-nine dollars
C. Ninety-nine and 
dollars
D. Ninety-nine and 
dollars
Factor.x2 + 5xy - 126y2
A. (x - 14y)(x + y) B. (x + 14y)(x - 9y) C. (x - 14y)(x + 9y) D. (x - y)(x + 9y)