Overview
\[\,\]
The length of time that we recommend members of each team spend on this topic are as follows:
\[\,\]
Alpha – 16 days
Bravo – 12 days
Charlie – 9 days
Delta – 7 days
Echo – 6 days
\[\,\]
Happy learning!
\[\,\]
Learning Objectives
State what is meant by a graph or network
Represent data on a graph
Describe the features of a graph
Distinguish between different types of graph
State if two or more graphs are isomorphic to each other
Describe edges and nodes that are directly connected to each other
State the degree of a node
Find the total degree of a graph using the hand-shaking lemma
Distinguish between a walk, a path and a cycle
State what is meant by a matrix
Multiply small matrices of different sizes together
Multiply large matrices of different sizes together using a matrix calculator
Find the adjacency matrix for a given network and vice versa
Use adjacency matrices to count the number of walks of length \(l\) between two particular nodes of a network
\[\,\]
Keywords
graph
network
node
vertex
edge
arc
connected graph
disconnected graph
loop
simple graph
isomorphic
subgraph
weighted graph
digraph
subdigraph
adjacent nodes
incident
degree
valency
order
hand-shaking lemma
walk
open walk
closed walk
path
cycle
matrix
square matrix
adjacency matrix
main diagonal
\[\,\]
