SmarterEd

Aussie Maths & Science Teachers: Save your time with SmarterEd

  • Login
  • Get Help
  • About

Networks, STD2 N2 HSC 2025 1 MC

Consider the network diagram.
 

Which vertex has degree 4?

  1. \(A\)
  2. \(B\)
  3. \(C\)
  4. \(D\)
Show Answers Only

\(B\)

Show Worked Solution

\(\text{Vertex }B\ \text{has 4 edges leading from it so has degree 4.}\)

\(\Rightarrow B\)

Filed Under: Basic Concepts, Network Concepts (Std2-2027) Tagged With: Band 2, smc-6307-50-Degree of Vertices, smc-912-40-Degrees of Vertices

v1 Networks, STD2 N2 2021 HSC 2 MC

Consider the network diagram.
 

What is the sum of the degrees of all the vertices in this network?

  1.  5
  2.  8
  3.  14
  4.  16
Show Answers Only

`D`

Show Worked Solution

`text(Working from)\ A\ text(to)\ E:`

COMMENT: This simple question caused problems for many with mean mark just 58%.
`text{Sum of degrees}` `= 4 + 3 + 4 + 2 + 3`
  `= 16`

 
`=> D`

Filed Under: Basic Concepts (Std 2-X) Tagged With: Band 4, smc-912-40-Degrees of Vertices

v1 Networks, STD2 N2 2012 FUR1 1 MC

The sum of the degrees of all the vertices in the graph above is

A.    `6`

B.    `7`

C.   `9`

D.   `14`

Show Answers Only

`D`

Show Worked Solution

`text(Total Degrees)`

`=1 + 3 + 2 + 2 + 2 + 2`

`=12`

`rArr D`

Filed Under: Basic Concepts (Std 2-X) Tagged With: Band 2, smc-1136-40-Degrees of Vertices, smc-912-40-Degrees of Vertices

Networks, STD2 N2 2021 HSC 2 MC

Consider the network diagram.
 

What is the sum of the degrees of all the vertices in this network?

  1.  5
  2.  8
  3.  14
  4.  16
Show Answers Only

`D`

Show Worked Solution

`text(Working from)\ A\ text(to)\ E:`

COMMENT: This simple question caused problems for many with mean mark just 58%.
`text{Sum of degrees}` `= 4 + 3 + 4 + 2 + 3`
  `= 16`

 
`=> D`

Filed Under: Basic Concepts, Network Concepts (Std2-2027) Tagged With: Band 4, smc-6307-50-Degree of Vertices, smc-912-40-Degrees of Vertices

Networks, STD2 N2 2020 HSC 9 MC

Team `A` and Team `B` have entered a chess competition.

Team `A` and `B` have three members each. Each member of Team `A` must play each member of Team `B` once.

Which of the following network diagrams could represent the chess games to be played?
 

 

 

 
Show Answers Only

`B`

Show Worked Solution

♦ Mean mark 38%.

`text(Vertices = players)`

`text(Edges = games between 2 players)`

`text(S)text(ince each player plays once against the three players)`

`text(in the other team, each vertex must be degree 3.)`

`=> \ B`

Filed Under: Basic Concepts, Network Concepts (Std2-2027) Tagged With: Band 5, smc-1136-40-Degrees of Vertices, smc-6307-50-Degree of Vertices, smc-6307-60-Other, smc-912-40-Degrees of Vertices, smc-912-50-Other

Networks, STD2 N2 2009 FUR1 8 MC

An undirected connected graph has five vertices.

Three of these vertices are of even degree and two of these vertices are of odd degree.

One extra edge is added. It joins two of the existing vertices.

In the resulting graph, it is not possible to have five vertices that are

A.   all of even degree.

B.   all of equal degree.

C.   one of even degree and four of odd degree.

D.   four of even degree and one of odd degree. 

Show Answers Only

`D`

Show Worked Solution

`text(Consider an example of the graph)`

♦♦♦ Mean mark 25%.

`text{described (below):}`
 

matrices-fur1-2009-vcaa-8-mc-answer
 

`A\ text(is possible – join)\ V\ text(and)\ Z`

`B\ text(is possible – join)\ V\ text(and)\ Z`

`C\ text(is possible – join)\ W\ text(and)\ Y`

`D\ text(is NOT possible)`

`=>  D`

Filed Under: Basic Concepts, Network Concepts (Std2-2027) Tagged With: Band 6, smc-6307-50-Degree of Vertices, smc-912-40-Degrees of Vertices

Networks, STD2 N2 SM-Bank 37

The map of Australia shows the six states, the Northern Territory and the Australian Capital Territory (ACT).
  

In the network diagram below, each of the vertices `A` to `H` represents one of the states or territories shown on the map of Australia. The edges represent a border shared between two states or between a state and a territory.
 

  1. In the network diagram, what is the order of the vertex that represents the Australian Capital Territory (ACT)?  (1 mark)

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

  2. In the network diagram, Queensland is represented by which letter? Explain why.  (2 marks)

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

Show Answers Only

i.    `1`

ii.   `text{NSW is Vertex B (it is connected to the ACT – Vertex D)}`

`=> C\ text{is Victoria as it has degree 2}`

`:.\ text(Queensland is vertex)\ A\ text(as it is connected to)\ B\ text(and has degree 3.)`

Show Worked Solution

i.     `text {ACT has 1 border (with NSW)}`

`:.\ text(Degree of ACT’s vertex = 1)`
 

ii.   `text{NSW is Vertex B (it is connected to the ACT – Vertex D)}`

`=> C\ text{is Victoria as it has degree 2}`

`:.\ text(Queensland is vertex)\ A\ text(as it is connected to)\ B\ text(and has degree 3.)`

Filed Under: Basic Concepts, Basic Concepts, Basic Concepts, Network Concepts (Std2-2027) Tagged With: Band 4, num-title-ct-extension, smc-1136-40-Degrees of Vertices, smc-1136-50-Other, smc-4788-60-Connected graphs, smc-4788-70-Applications, smc-6307-30-Map to Network, smc-6307-50-Degree of Vertices, smc-912-25-Map to Network, smc-912-40-Degrees of Vertices

Networks, STD2 N2 2011 FUR1 1 MC

In the network shown, the number of vertices of even degree is

  1. `2`
  2. `3`
  3. `4`
  4. `5`
Show Answers Only

`B`

Show Worked Solution

`text{Vertices with even degrees: 2, 2, 6}`

`=>  B`

Filed Under: Basic Concepts, Basic Concepts, Basic Concepts, Network Concepts (Std2-2027) Tagged With: Band 4, num-title-ct-path, smc-1136-40-Degrees of Vertices, smc-4788-20-Degrees of vertices, smc-6307-50-Degree of Vertices, smc-912-40-Degrees of Vertices

Networks, STD2 N2 2017 FUR1 2 MC

Two graphs, labelled Graph 1 and Graph 2, are shown below.
 

 
The sum of the degrees of the vertices of Graph 1 is

  1. two less than the sum of the degrees of the vertices of Graph 2.
  2. one less than the sum of the degrees of the vertices of Graph 2.
  3. equal to the sum of the degrees of the vertices of Graph 2.
  4. two more than the sum of the degrees of the vertices of Graph 2.
Show Answers Only

`C`

Show Worked Solution

`text(Graph 1)`

`∑\ text(degrees)\ = 3 + 3 + 3 + 3 = 12`

`text(Graph 2)`

`∑\ text(degrees)\ = 2 + 2 + 2 + 2 + 2 + 2 = 12`

`=> C`

Filed Under: Basic Concepts, Basic Concepts, Basic Concepts, Network Concepts (Std2-2027) Tagged With: Band 3, num-title-ct-path, smc-1136-40-Degrees of Vertices, smc-4788-20-Degrees of vertices, smc-6307-50-Degree of Vertices, smc-912-40-Degrees of Vertices

Networks, STD2 N2 SM-Bank 32 MC

The number of vertices with an odd degree in the network above is

  1. `2`
  2. `3`
  3. `4`
  4. `5`
Show Answers Only

`A`

Show Worked Solution

`rArr A`

`text{(Note a loop creates 2 extra degrees to a vertex.)}`

Filed Under: Basic Concepts, Basic Concepts, Network Concepts (Std2-2027) Tagged With: Band 3, smc-1136-40-Degrees of Vertices, smc-6307-50-Degree of Vertices, smc-912-40-Degrees of Vertices

Networks, STD2 N2 2015 FUR1 1 MC

In the graph above, the number of vertices of odd degree is

  1. `1`
  2. `2`
  3. `3`
  4. `4`
Show Answers Only

`B`

Show Worked Solution

`=> B`

Filed Under: Basic Concepts, Basic Concepts, Network Concepts (Std2-2027) Tagged With: Band 2, smc-1136-40-Degrees of Vertices, smc-6307-50-Degree of Vertices, smc-912-40-Degrees of Vertices

Networks, STD2 N2 2012 FUR1 1 MC

The sum of the degrees of all the vertices in the graph above is

A.    `6`

B.    `9`

C.   `11`

D.   `12`

Show Answers Only

`D`

Show Worked Solution

`text(Total Degrees)`

`=1 + 3 + 2 + 2 + 2 + 2`

`=12`

`rArr D`

Filed Under: Basic Concepts, Basic Concepts, Network Concepts (Std2-2027) Tagged With: Band 2, smc-1136-40-Degrees of Vertices, smc-6307-50-Degree of Vertices, smc-912-40-Degrees of Vertices

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