A path that uses each edge of a graph exactly once and ends at the starting vertex
Step-by-step explanation:
- Euler path - uses every edge of a graph exactly once
- Euler circuit - uses every edge of a graph exactly once
- Euler path - starts and ends at different vertices
- Euler circuit - starts and ends at the same vertex
Answer:
x=2, y=-2
(2, -2)
Step-by-step explanation:
x + y = 0
3x - 2y = 10
3x - 2(0 - x) = 10 ( 2(0 - x) = -2x )
3x - (-2x) = 10 ( y = -x )
3x + 2x = 10
5x = 10
x = 2
Hope i helped, feel free to ask questions :D
Have a good day!
Answer:
41
Step-by-step explanation:
Answer:
For the first one the answer is 2
For the second one the answer is 72
Step-by-step explanation:
Πr^2(h)
π(1.2)^2)(4)=18.1 ft^3
22*18.1=398.2
