115k views
4 votes
Which of the following is true of vertex-edge graphs.

(1)They can model real-world problems.
(2)They can all be solved.
(3)Euler paths are the same as Hamilton paths.
(4)All vertices must be used once in Hamilton circuits.

User Zireael
by
4.7k points

2 Answers

1 vote

Answer:

2 and 4

Explanation:

User Malas
by
5.0k points
4 votes
The answer is 2 they can all be solved
User Adrien Gibrat
by
5.7k points