Let a graph have vertices {L, M, N, O, P, Q, R, S} and edge set {{L,R}, {M,P}, {M,Q}, {N,Q}, {P,R}, {Q,S}, {R,S}} .
Verdich [7]
Answer:
a) The degree of vertex P is 2.
b) The degree of vertex O is 0.
c) The graph has 2 components.
Step-by-step explanation:
a) The edges that have P as a vertice are {M,P} and {P,R}.
b) There is no edge with extreme point O.
c) One of the components is the one with the only vertex as O and has no edges. The other component is the one with the rest of the vertices and all the edges described.
The file has a realization of the graph.
Answer:
After 12.2 miles
Step-by-step explanation:
You can check this by graphing y = 0.85+16.75 and y = 0.40 + 22.25 and looking for the solution (the point where they intersect).
You can also use the elimination or substitution method.
Your answer would be 11 loaves of bread. If you need an exclamation let me know and I will talk you through it. Have a great day!
