v1 Networks, STD2 N2 2012 FUR1 1 MC
Networks, STD2 N2 2021 HSC 2 MC
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?
|
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.
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.
- 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) ---
- In the network diagram, Queensland is represented by which letter? Explain why. (2 marks)
--- 4 WORK AREA LINES (style=lined) ---
Networks, STD2 N2 2011 FUR1 1 MC
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
- two less than the sum of the degrees of the vertices of Graph 2.
- one less than the sum of the degrees of the vertices of Graph 2.
- equal to the sum of the degrees of the vertices of Graph 2.
- two more than the sum of the degrees of the vertices of Graph 2.
Networks, STD2 N2 SM-Bank 32 MC
Networks, STD2 N2 2015 FUR1 1 MC
In the graph above, the number of vertices of odd degree is
- `1`
- `2`
- `3`
- `4`
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`