Decision Maths 2.5 / 5 based on 4 ratings ? MathematicsNetworks, algorithms and problem solvingA2/A-levelEdexcel Created by: alexCreated on: 02-10-12 12:03 Algorithm well-defined sequence of steps leading to the solution of a problem of a given type. 1 of 14 Graph A diagram involving a set of vertices and edges 2 of 14 Isomorphic of the same form 3 of 14 Connected graph If it is possible to travel from any vertex to any other vertex 4 of 14 Complete graph A simple graph (no loops) with an edge connecting to each possible pair of vertices (kn) 5 of 14 Bipartite graph The vertices belong to two distinct sets and each edge joins a vertex in one set to a vertex in another 6 of 14 Degree (of a vertex) The number of edges a vertex is connected to. 7 of 14 Directed network Is a weighted graph with directed edges 8 of 14 Journey/walk continuous sequenc of edges 9 of 14 Path A walk that does not pass through any vertex more than once 10 of 14 Closed path/cycle/circuit Returns to its start vertex 11 of 14 Tree A connected graph with no cycles 12 of 14 Traversable/Eulerian If a trail is closed and includes every edge once and only once (all vertices are of an even degree) 13 of 14 Semi-traversable Has two odd vertices, can only be drawn by starting and ending at different points 14 of 14
Comments
No comments have yet been made