Hamiltonian Paths & Cycles What are Hamiltonian paths and cycles? A path is a walk in which no vertices are repeated A Hamiltonian path is a path in which each vertex in a graph is visited exac...
Eulerian Trails & Circuits What are Eulerian trails and circuits? A trail is a walk in which no edge is repeated An Eulerian trail is a trail that visits each edge in a graph exactly once A cir...
Kruskal's Algorithm In a situation that can be modelled by a graph, Kruskal’s algorithm is a mathematical tool that can be used to reduce costs, materials or time. Why do we use Kruskal’s Algorithm...
Walks & Adjacency Matrices Adjacency matrices are another way to represent graphs and connections between the different vertices. What is an adjacency matrix? An adjacency matrix can be used to...
Parts of a Graph A graph is a mathematical structure that is used to represent objects and the connections between them. They can be used in modelling many real-life applications, e.g. electrical c...
Vectors & Constant Velocity How are vectors used to model linear motion? If an object is moving with constant velocity it will travel in a straight line For an object moving in a straight line ...
Kinematics using Vectors How are vectors related to kinematics? Kinematics is the use of mathematics to model motion in objects If an object is moving in one dimension then its velocity, displaceme...
Shortest Distance Between a Point and a Line How do I find the shortest distance from a point to a line? The shortest distance from any point to a line will always be the perpendicular distance Not...
Equation of a Line in Vector Form How do I find the vector equation of a line? The formula for finding the vector equation of a line is This is given in the formula booklet This equation can be use...
