Decision 1 Graphs 0.0 / 5 ? MathematicsNetworks, algorithms and problem solvingA2/A-levelOCR Created by: Mariya_99Created on: 03-04-17 11:05 Tree A connected graph with no cycles 1 of 12 Simple graph A graph with noo loops or multiple edges, 1 edge connects any two vertices 2 of 12 A Path A route from one vertex to another which doesnt repeat an edge or vertex 3 of 12 A cycle A route starting and ending at the same vertex 4 of 12 Complete graph A sample graph in which every pair of vertices is connected by an edge 5 of 12 Connected graph All pairs of vertices are connected, there is a route between all pairs of vertices 6 of 12 Bipartite graph Has two sets pf vertices and the edges only connect vertices from one set to the other 7 of 12 Planar graph One that can be drawn without any edges crossing eachother 8 of 12 Sub graph Any set of vertices and edges taken from a whole graph 9 of 12 Hamiltonian cycle A cycle that visits every vertex of a graph 10 of 12 Eularian cycle A cycle that travels along every edge of a graph (nodes are all even) 11 of 12 Di graph A graph in which the edges indicate direction 12 of 12
Comments
No comments have yet been made