Perplex
Dashboard
Browse by TopicReview VideosFormula BookletMy Progress
BlogLanding Page
Sign UpLogin
Perplex
Perplex
Dashboard
Browse by TopicReview VideosFormula BookletMy Progress
BlogLanding Page
Sign UpLogin
Perplex
IB Math AIHL
/
Graph Theory
/
Problem Bank
IB Math AIHL
/
Graph Theory
/
Problem Bank

Ask Plex AI about this problem

Get hints, ask questions, and work through this problem step by step

I'm Plex, here to help with problems on this worksheet!

Ask Plex AI about this problem

Get hints, ask questions, and work through this problem step by step

I'm Plex, here to help with problems on this worksheet!
[Maximum mark: 4]
<p>A graph with 5 vertices and 8 edges.</p><p>Vertices: A, B, C, D, E.</p><p>Edges:</p><p>- An undirected edge between A and B.</p><p>- An undirected edge between D and B.</p><p>- An undirected edge between E and C.</p><p>- An undirected edge between C and D.</p><p>- An undirected edge between A and E.</p><p>- An undirected edge between D and E.</p><p>- An undirected edge between B and E.</p><p>- An undirected edge between D and C.</p>
  1. State whether the graph above is simple.

    [2]

    To earn a crown, get your answer ready before you reveal the options!

The adjacency matrix for a graph is ​⎝⎜⎜⎜⎜⎛​01110​11001​10011​10101​01110​⎠⎟⎟⎟⎟⎞​.

  1. State whether the graph corresponding to the adjacency matrix is simple.

    [2]
[Maximum mark: 4]
<p>A graph with 5 vertices and 8 edges.</p><p>Vertices: A, B, C, D, E.</p><p>Edges:</p><p>- An undirected edge between A and B.</p><p>- An undirected edge between D and B.</p><p>- An undirected edge between E and C.</p><p>- An undirected edge between C and D.</p><p>- An undirected edge between A and E.</p><p>- An undirected edge between D and E.</p><p>- An undirected edge between B and E.</p><p>- An undirected edge between D and C.</p>
  1. State whether the graph above is simple.

    [2]

    To earn a crown, get your answer ready before you reveal the options!

The adjacency matrix for a graph is ​⎝⎜⎜⎜⎜⎛​01110​11001​10011​10101​01110​⎠⎟⎟⎟⎟⎞​.

  1. State whether the graph corresponding to the adjacency matrix is simple.

    [2]