Draw a directed graph to represent each of the following food chain descriptions. Draw the arrows pointing from the animal that is eaten to the animal that eats it.

Within a water system:

Tadpoles, water beetles and snails all survive by eating algae.
Small fish eat the tadpoles, whilst frogs survive on water beetles and snails.
The kingfisher, a skillful fishing bird, survives on eating small fish and frogs.

Rabbits and squirrels both eat plants. Foxes and hawks eat both rabbits and squirrels.

The killer whale depends on tuna as a primary food source. In turn, the tuna feeds on fish called mackerel. For mackerel to survive, they depend on microscopic organisms collectively known as zooplankton.

For each of the following networks, state:

What the edges represent.

What the vertices represent.

iii

The number of vertices.

The number of edges.

This network represents the internet fiber optics cables connecting several cities:

This network represents an electrical circuit that includes a globe, resistors and multiple switches.

This network displays newspaper routes between several houses:

This network represents the roads between several towns:

Consider the map below which shows major roads connecting various towns. The shaded regions indicate how far each town extends:

Draw a graph that represents the major roads connecting towns on the map.

A beach volleyball team of 5 players can use 3 players in any one game.

The table shows the combinations that the coach has already used in the first three games:

Games	Players chosen
1	Ryan, Jimmy, Lucy
2	Lucy, Beth, Ellie
3	Ellie, Ryan, Jimmy

Draw a network to represent this information.

There is one more game left in the tournament. Which players should the coach choose so that every team member has played with every other team member at least once?

A group of journalists have been asked to work in pairs to collaborate on an article.

Derek has already collaborated with Neil, Xavier, and Xanthe.
Neil has already collaborated with Xanthe, Xavier, and Tina.
Xanthe and Tina have collaborated together.

Draw an undirected graph to represent the journalists who have worked together.

Name the journalists who still need to collaborate with someone else so that each journalist will have collaborated with every other journalist at least once.

Over a year students work in pairs to complete poster projects.

A group of 4 friends have already completed the following projects together:

Project	Pair who worked on it
Electricity	Aaron and Rochelle
Solar Energy	Aaron and Bianca
Water Cycle	Mario and Rochelle
Acid Rain	Mario and Bianca

Draw an undirected graph to represent the pairs of students who have completed projects together.

Name the pairs of students that should work together on the next poster project so that all 4 friends have worked with each other.

Consider the following image which shows a train network, and the stations that are connected by train lines:

Draw the graph that represents the train network.

The following table displays the times buses arrive and depart from several bus stops:

Teribithia	1 : 39 am	4 : 23 am
Narnia		6 : 36 am	8 : 44 am
Nod	4 : 29 am		9 : 29 am
Oz	5 : 36 am	8 : 18 am	11 : 51 am

Draw the graph that represents the bus routes.

Undirected networks and adjacency matrices

Create an adjacency matrix for the following network:

For each of the given networks:

Create an adjacency matrix for the network.

State the degree of the vertex indicated.

Vertex A

Vertex P

Vertex Q

Vertex P

For each of the following adjacency matrices, draw the corresponding network:

\begin{matrix} & \begin{matrix} A&B&C&D\end{matrix}\\ \begin{matrix} A\\ B\\ C\\D \end{matrix} & \begin{bmatrix}0 & 0 & 1 & 1\\ 0 & 0 & 1 & 1 \\ 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 0 \end{bmatrix} \end{matrix}

\begin{matrix} & \begin{matrix} A&B&C&D\end{matrix}\\ \begin{matrix} A\\ B\\ C\\D \end{matrix} & \begin{bmatrix}0 & 1 & 0 & 0\\ 1 & 1 & 0 & 1 \\ 0 & 0 & 1 & 1 \\ 0 & 1 & 1 & 0 \end{bmatrix} \end{matrix}

\begin{matrix} & \begin{matrix} P&Q&R&S&T\end{matrix}\\ \begin{matrix} P\\ Q\\ R\\S\\T \end{matrix} & \begin{bmatrix}0 & 1 & 2 & 0 & 0\\ 1 & 0 & 0 & 0 & 0 \\ 2 & 0 & 0 & 1 & 0 \\ 0 & 0 & 1 & 1 & 1 \\ 0 & 0 & 0 & 1 & 0 \end{bmatrix} \end{matrix}

\begin{bmatrix} 0&0&1&1&1 \\ 0&0&2&0&0 \\1&2&0&0&0 \\1&0&0&2&0 \\1&0&0&0&2 \end{bmatrix}

The following adjacency matrix lists the fees (as a percentage) charged by a bank to convert between five types of currency:

Represent this information using a network.

\begin{matrix} & \begin{matrix} \text{USD} & \text{AUS} & \text{NZD} & \text{EUR} & \text{YEN} \end{matrix} \\ \begin{matrix} \text{USD} \\ \text{AUS} \\ \text{NZD} \\ \text{EUR} \\ \text{YEN}\end{matrix} & \begin{bmatrix} \qquad & 2 \qquad & 5 \qquad & 4 \qquad & 4 \\ 2 \qquad & \qquad & 3 \qquad & 5 \qquad & 4 \\ 5 \qquad & 3 \qquad & \qquad & 7 \qquad & 6 \\ 4 \qquad & 5 \qquad & 7 \qquad & \qquad & 3 \\ 4 \qquad & 4 \qquad & 6 \qquad & 3 \qquad & \end{bmatrix} \end{matrix}

The following adjacency matrix lists the amount of time it takes to queue up for three rides at an amusement park, and the amount of time it takes to travel between them:

Represent this information using a network.

\begin{matrix} & \begin{matrix} \text{Carousel} & \text{P. S.} & \text{H.H.} \end{matrix} \\ \begin{matrix} \text{Carousel} \\ \text{Pirate Ship} \\ \text{Haunted House} \end{matrix} & \begin{bmatrix} 3 \qquad & 5 \qquad & 4 \\ 5 \qquad & 13 \qquad & 6 \\ 4 \qquad & 6 \qquad & 11 \end{bmatrix} \end{matrix}

Directed networks and adjacency matrices

Create an adjacency matrix for each of these networks:

For each of the following adjacency matrices, draw the corresponding network:

\begin{matrix} & \begin{matrix} X&Y&Z\end{matrix}\\ \begin{matrix} X\\ Y\\ Z \end{matrix} & \begin{bmatrix}0 & 0 & 0 \\ 2 & 0 & 0 \\ 1 & 1 & 0 \end{bmatrix} \end{matrix}

\begin{matrix} & \begin{matrix} A&B&C&D&E\end{matrix}\\ \begin{matrix} A\\ B\\ C\\D\\E \end{matrix} & \begin{bmatrix}0 & 2 & 0 & 0 & 0\\ 0 & 0 & 0 & 1 &0\\ 1 & 0 & 0 & 0 & 1 \\ 0 & 0 & 1 & 0 & 0 \\ 0 & 0 & 0 & 2 & 0 \end{bmatrix} \end{matrix}

Consider the given graph:

Create the corresponding adjacency matrix, M.

State the number of one-stage paths between B and D.

Find the second-stage adjacency matrix M^2 using technology or otherwise.

Hence determine the number of two-stage paths between C and D.

Consider the given graph:

Create the corresponding adjacency matrix, M.

State the number of one-stage paths between R and S.

Find the second-stage adjacency matrix M^2 using technology or otherwise.

There are four two-stage paths from S to P. Give an example of one of these paths.

Consider the given graph:

Create the corresponding adjacency matrix, M.

Find the second-stage adjacency matrix M^2 using technology or otherwise.

State the number of two-stage paths between I and F.

Give an example of one of the two-stage paths from I to F.

Find the third-stage adjacency matrix M^3 using technology or otherwise.

Hence state the number of three-stage paths between I and F.

Consider the given graph:

Create the corresponding adjacency matrix, M.

Find the second-stage adjacency matrix M^2 using technology or otherwise.

State the number of two-stage paths between Y and X.

State a two-stage path from Y to X.

Find the third-stage adjacency matrix M^3 using technology or otherwise.

State the vertices that are connected by a three-stage path. Write only the start and end vertices of each path.

Consider the given graph:

Create the corresponding adjacency matrix, M.

Create the adjacency matrix, M^3 using technology or otherwise.

List the vertices connected by 5 different three-stage paths. Give a single example, writing only the start and end vertices.

The following adjacency matrix lists the number of likes that four friends give to each other's social media posts over a week:

Represent this information using a directed network.

\begin{matrix} & \text{Receiver} \\ \text{Sender} & \begin{matrix} & \begin{matrix} \text{Rick} & \text{Fan} & \text{Zoya} & \text{Aarav} \end{matrix} \\ \begin{matrix} \text{Rick} \\ \text{Fan} \\ \text{Zoya} \\ \text{Aarav} \end{matrix} & \begin{bmatrix} \quad & 32 \quad & 12 \quad & 13 \\ 6 \quad & \quad & 9 \quad & 4 \\ 41 \quad & 53 \quad & \quad & 23 \\ 11 \quad & 39 \quad & 2 \quad & \end{bmatrix} \end{matrix} \end{matrix}

The following adjacency matrix lists the number of termites observed to be moving within and between three sites in 1 hour:

Represent this information using a directed network.

\begin{matrix} & \quad \text{Destination} \\ \text{Origin} & \begin{matrix} & \begin{matrix} \text{Nest} & \text{Plains} & \text{Forest} \end{matrix} \\ \begin{matrix} \text{Nest} \\ \text{Plains} \\ \text{Forest} \end{matrix} & \begin{bmatrix} 3570 \quad & 325 \quad & 1240 \\ 65 \quad & 475 \quad & 965 \\ 410 \quad & 535 \quad & 230 \end{bmatrix} \end{matrix} \end{matrix}

Key features of adjacency matrices

Which key features indicates that this adjacency matrix represents a complete graph?

\begin{bmatrix} 0 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 \\ 1 & 1 & 0 & 1 \\ 1 & 1 & 1 & 0 \end{bmatrix}

Which key feature indicates that this adjacency matrix represents a directed graph?

\begin{bmatrix} 0 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 \\ 2 & 0 & 2 & 1 \\ 0 & 0 & 0 & 0 \end{bmatrix}

Which key feature indicates that there are loops in the graph represented by this adjacency matrix?

\begin{bmatrix} 1 & 1 & 1 & 0 \\ 2 & 1 & 0 & 0 \\ 0 & 2 & 0 & 0 \\ 1 & 1 & 0 & 0 \end{bmatrix}

Which key feature indicates there are multiple edges in the graph represented by this adjacency matrix?

\begin{bmatrix} 0 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 \\ 2 & 0 & 2 & 1 \\ 0 & 0 & 0 & 0 \end{bmatrix}

For each adjacency matrix, describe the associated graph using the appropriate terms from the given list:

Complete
Bipartite
Directed
Simple

\begin{bmatrix} 0 & 1 & 1 & 1 \\ 1 & 0 & 1 & 1 \\ 1 & 2 & 0 & 2 \\ 1 & 0 & 0 & 0 \end{bmatrix}

\begin{bmatrix} 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 \\ 0 & 0 & 0 & 1 \\ 1 & 1 & 1 & 0 \end{bmatrix}

State whether the following adjacency matrix represents a bipartite graph:

\begin{bmatrix} 0 & 0 & 0 & 1 \\ 1 & 0 & 1 & 1 \\ 1 & 1 & 0 & 1 \\ 1 & 1 & 0 & 0 \end{bmatrix}

Consider the adjacency matrix shown:

State the key feature that indicates that the graph represented by this adjacency matrix is a bipartite graph.

State whether the matrix represents a complete bipartite graph.

\begin{bmatrix} 0 & 0 & 1 & 1 \\ 0 & 0 & 1 & 1 \\ 1 & 1 & 0 & 0 \\ 1 & 1 & 0 & 0 \end{bmatrix}

Consider the adjacency matrix shown that represents a bipartite graph:

List the vertices in the bipartite group containing 2 vertices.

State whether the matrix represents a complete bipartite graph.

\begin{matrix} & \begin{matrix} A&B&C&D&E\end{matrix}\\ \begin{matrix} A\\ B\\ C\\D\\E \end{matrix} & \begin{bmatrix}0 & 1 & 0 & 1 & 0\\ 1 & 0 & 1 & 0 & 1\\ 0 & 1 & 0 & 0 & 0\\ 1 & 0 & 0 & 0 & 0\\ 0 & 1 & 0 & 0 & 0 \end{bmatrix} \end{matrix}

Create an adjacency matrix for the following complete bipartite graph:

Create an adjacency matrix for the following bipartite graph:

Outcomes

ACMGM079

identify practical situations that can be represented by a network, and construct such networks; for example, trails connecting camp sites in a National Park, a social network, a transport network with one-way streets, a food web, the results of a round-robin sporting competition

ACMGM080

construct an adjacency matrix from a given graph or digraph

4.02 Network representations

Outcomes

ACMGM079

ACMGM080

What is Mathspace

About Mathspace