Perplex
Dashboard
Topics
Exponents & LogarithmsApproximations & ErrorSequences & SeriesMatricesComplex NumbersFinancial Mathematics
Cartesian plane & linesFunction TheoryModellingTransformations & asymptotes
2D & 3D GeometryVoronoi DiagramsTrig equations & identitiesVectorsGraph Theory
ProbabilityDescriptive StatisticsBivariate StatisticsDistributions & Random VariablesInference & Hypotheses
DifferentiationIntegrationDifferential Equations
Review VideosFormula BookletMy Progress
BlogLanding Page
Sign UpLogin
Perplex
Perplex
Dashboard
Topics
Exponents & LogarithmsApproximations & ErrorSequences & SeriesMatricesComplex NumbersFinancial Mathematics
Cartesian plane & linesFunction TheoryModellingTransformations & asymptotes
2D & 3D GeometryVoronoi DiagramsTrig equations & identitiesVectorsGraph Theory
ProbabilityDescriptive StatisticsBivariate StatisticsDistributions & Random VariablesInference & Hypotheses
DifferentiationIntegrationDifferential Equations
Review 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 4 vertices and 6 edges.</p><p>Vertices: A, B, C, D.</p><p>Edges:</p><p>- A directed edge from A to B.</p><p>- A directed edge from B to C.</p><p>- A directed edge from C to D.</p><p>- A directed edge from A to D.</p><p>- A directed edge from B to D.</p><p>- A directed edge from C to A.</p>
  1. State with reason whether the graph above is strongly connected.

    [2]

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

  2. Hence, find the number of paths of length ​5​ starting at ​D​ and ending at ​A.

    [2]
[Maximum mark: 4]
<p>A graph with 4 vertices and 6 edges.</p><p>Vertices: A, B, C, D.</p><p>Edges:</p><p>- A directed edge from A to B.</p><p>- A directed edge from B to C.</p><p>- A directed edge from C to D.</p><p>- A directed edge from A to D.</p><p>- A directed edge from B to D.</p><p>- A directed edge from C to A.</p>
  1. State with reason whether the graph above is strongly connected.

    [2]

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

  2. Hence, find the number of paths of length ​5​ starting at ​D​ and ending at ​A.

    [2]