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 2 3 4 Show Answers Only `C` Show Worked Solution `text{Consider each statement:}` `text{Graph is planar}\ -> \text{edges only meet at vertices (True)}` `text{Graph contains a cycle}\ -> \text{multiple cycles exist (True)}` `text{Graph is connected}\ -> \text{a path exists to connect any}` `text{two vertices (True)}` `text{Graph contains an Eulerian trail}\ -> \text{requires two (only)}` `text{vertices of an odd degree (False)}` `=> C`
