Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
23 views

Decision Mathematics D1 (AS)

The document provides definitions and explanations of key terms related to algorithms, graphs, critical path analysis, and matchings. It includes descriptions of concepts like algorithms, graphs and their components, paths, cycles, trees, matchings, and critical path analysis.

Uploaded by

chelsea
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
23 views

Decision Mathematics D1 (AS)

The document provides definitions and explanations of key terms related to algorithms, graphs, critical path analysis, and matchings. It includes descriptions of concepts like algorithms, graphs and their components, paths, cycles, trees, matchings, and critical path analysis.

Uploaded by

chelsea
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Unit D1 Decision Mathematics D1 (AS)

Glossary for D1

1 Algorithms
1 1
In a list containing N items the ‘middle’ item has position [ 2 (N + 1)] if N is odd [ 2 (N + 2)] if N is even, so
that if N = 9, the middle item is the 5th and if N = 6 it is the 4th.

2 Algorithms on graphs
A graph G consists of points (vertices or nodes) which are connected by lines (edges or arcs).
A subgraph of G is a graph, each of whose vertices belongs to G and each of whose edges belongs to G.
If a graph has a number associated with each edge (usually called its weight) then the graph is called a
weighted graph or network.
The degree or valency of a vertex is the number of edges incident to it. A vertex is odd (even) if it has odd
(even) degree.
A pathLVD¿QLWHVHTXHQFHRIHGJHVVXFKWKDWWKHHQGYHUWH[RIRQHHGJHLQWKHVHTXHQFHLVWKHVWDUWYHUWH[
of the next, and in which no vertex appears more then once.
A cycle (circuit LVDFORVHGSDWKLHWKHHQGYHUWH[RIWKHODVWHGJHLVWKHVWDUWYHUWH[RIWKH¿UVWHGJH
Two vertices are connected if there is a path between them. A graph is connected if all its vertices are
connected.
If the edges of a graph have a direction associated with them they are known as directed edges and the graph
is known as a digraph.
A tree is a connected graph with no cycles.
A spanning tree of a graph G is a subgraph which includes all the vertices of G and is also a tree.
A minimum spanning tree (MST) is a spanning tree such that the total length of its arcs is as small as
possible. (MST is sometimes called a minimum connector.)
A graph in which each of the n vertices is connected to every other vertex is called a complete graph.

4 Critical path analysis


The WRWDOÀRDW F(i, j) of activity (i, j LVGH¿QHGWREHF(i, j) = lj – ei – duration (i, j), where ei is the earliest
time for event i and lj is the latest time for event j.

6 Matchings
A bipartite graph consists of two sets of vertices X and Y. The edges only join vertices in X to vertices in Y,
not vertices within a set. (If there are r vertices in X and s vertices in Y then this graph is Kr,s.)
A matching is the pairing of some or all of the elements of one set, X, with elements of a second set, Y. If
every member of X is paired with a member of Y the matching is said to be a complete matching.

100 Section D © Pearson Education Limited 2013 Pearson Edexcel Level 3 GCE in Mathematics

You might also like