Networks, SMB-015 MC

Consider the following four statements about the graph above:

• • The graph is planar.
  • The graph contains a cycle.
  • The graph is connected.
  • The graph contains an Eulerian trail.

How many of these statements are true?

1. 1
2. 2
3. 3
4. 4