SmarterEd

Aussie Maths & Science Teachers: Save your time with SmarterEd

  • Login
  • Get Help
  • About

Networks, SMB-011

A network diagram is drawn below.
 

  1. Starting at vertex `Q`, identify all five different paths that end at vertex `S`.   (2 marks)

    --- 3 WORK AREA LINES (style=lined) ---

  2. Starting at vertex `P`, identify four different cycles that exist in the network.   (2 marks)

    --- 3 WORK AREA LINES (style=lined) ---

  3. Starting at vertex `P`, what is the total number of cycles that exist in the network.  (1 mark)

    --- 2 WORK AREA LINES (style=lined) ---

Show Answers Only

i.    `text{Paths from}\ Q–S:`

`QS, QRS, QRPS, QPRS, QPS`
 

ii.    `text{Cycle: a path that ends at the same vertex without}`

`text{repeating any vertices.}`

`text{Possible cycles (any 4 from the following):}`

`PQRP, PQSRP, PQRSP, PQSP, PSRP`

`PSRQP, PSQRP, PSQP`
 

iii.  `8\ \text{(see listed in part (ii))}`

Show Worked Solution

i.    `text{Paths from}\ Q–S:`

`QS, QRS, QRPS, QPRS, QPS`
 

ii.    `text{Cycle: a path that ends at the same vertex without}`

`text{repeating any vertices.}`

`text{Possible cycles (any 4 from the following):}`

`PQRP, PQSRP, PQRSP, PQSP, PSRP`

`PSRQP, PSQRP, PSQP`
 

iii.  `8\ \text{(see listed in part (ii))}`

Filed Under: Trails, Paths and Cycles Tagged With: num-title-ct-path, smc-4789-20-Paths, smc-4789-30-Cycle

Copyright © 2014–2025 SmarterEd.com.au · Log in