D1 - Graph terminology 2.0 / 5 based on 1 rating ? MathematicsGraphs and transformationsASEdexcel Created by: Jess HCreated on: 22-01-13 16:30 Connected Graph A path can be found between any two verticies 1 of 21 Cycle A closed path 2 of 21 Path A series of edges where no vertex is repeated 3 of 21 Walk A path where verticies can be repeated 4 of 21 Loop An edge which starts and ends at the same vertex 5 of 21 Vertex A point, a node 6 of 21 Edge An arc, a line 7 of 21 Simple graph A graph with no loops and no more than one edge connecting any pair of verticies 8 of 21 Subgraph A section of another graph 9 of 21 Isomorphic A graph which is the same but drawn differently 10 of 21 Tree A connected graph with no cycles 11 of 21 (MST) Minimum spanning tree A tree which contains all the verticies of the original graph and is of minimum length 12 of 21 Spanning tree A tree which contains all the verticies of the original graph 13 of 21 Weighted graph A graph with edges with units of weight 14 of 21 Digraph A graph with directed edges 15 of 21 Bipartite graph A graph made up of two sets of vertices, x and y, where edges connect only verticies from x to y and vice versa 16 of 21 Complete graph A graph where all verticies are directly connected by an edge to every other vertex 17 of 21 Complete bipartite graph A bipartite graph where all verticies from set x are connected to all verticies from set y 18 of 21 Distance matrix A table which shows systematically all the edges in a graph and their weights 19 of 21 Valency AKA: Degree, order. The number of edges connected to a vertex 20 of 21 Adjacency matrix A table which shows systematically all the verticies in a graph and how they are connected by edges 21 of 21
Comments
No comments have yet been made