D1 Key Terms 0.0 / 5 ? MathematicsDecision MathmaticsASEdexcel Created by: BecsaBabeCreated on: 08-06-15 21:51 Node/Point/Vertex Place on a graph where arcs meet 1 of 22 Arc/Edge/Path Represents distance between two nodes 2 of 22 Cycle A closed path 3 of 22 Graph A set of arcs and nodes 4 of 22 Valency The number of arcs entering a node 5 of 22 Algorithm Precise set of instructions leading to a solution for a particular problem 6 of 22 Hamiltonian Cycle Cycle which goes through every vertex once 7 of 22 Eulerian Cycle Cycle which traverses every edge exactly once. (must have 0 or 2 odd nodes) 8 of 22 Odd Node A vertex with an odd valency 9 of 22 Complete Graph A single edge between all nodes 10 of 22 Connected Graph A path/walk exists between all nodes 11 of 22 Simple Graph No loops or repeated edges 12 of 22 Loop Edges from a vertex back to itself 13 of 22 Diagraph Graph with at least one directional edge 14 of 22 Bipartite Graph Have 2 sets of nodes. Nodes in the same set do not have edges between them 15 of 22 Planar Graph Can be drawn without edges crossing 16 of 22 Weight Number associated with an edge 17 of 22 Isomorphic Graphs that 'look' different with the same vertex connections 18 of 22 Subgraph A subset of nodes and edges from a larger graph 19 of 22 Tree Connected graph with no cycles 20 of 22 Spanning Tree Tree which includes and connects all nodes on a graph 21 of 22 Minimum Spanning Tree Spanning tree connecting all nodes in the minimum distance/weight 22 of 22

## Comments

No comments have yet been made