Decision Graph Definitions 0.0 / 5 ? MathematicsDecisions GraphsA2/A-levelOCR Created by: Amber HegartyCreated on: 07-04-16 18:25 Arc (Edge) A line connecting two nodes (vertices) on a graph 1 of 20 Bipartite Graph Vertices fall into two sets and each edge has a vertex with one set at one end and the other set at the other end. 2 of 20 Complete graph simple graph in which every pair of vertices is connected by an edge. 3 of 20 Connected graph Where a path exists between every pair of vertices. 4 of 20 Cycle A closed path 5 of 20 Degree The degree (or order) of a vertex is the number of arcs (edges() connecting to it 6 of 20 Digraph Graph in which at least one arc ((edge) has a direction associated with it. 7 of 20 Discrete set A set which can be counted 8 of 20 Graph A set of vertices linked in some way with arcs (edges) 9 of 20 Hamilton cycle A cycle which visits every vertex. Each vertex is visited once and only once. 10 of 20 Incidence matrix A way of representing a graph on a matrix. 11 of 20 Isomorphic Two graphs are isomorphic if one can be stretched, twisted or otherwise distorted into the other 12 of 20 Loop An arc whose beginning and end both link to the same vertex. 13 of 20 Vertex (Node) A point on a graph that is connected to other vertices by arcs. 14 of 20 Path A trail in which no vertex is repeated 15 of 20 Planar graph A graph which can be drawn with any arcs crossing 16 of 20 Simple graph A graph in which tehre are no loops and in which there is no more than one arc connecting any pair of vertices. 17 of 20 Trail A walk in which no arc is repeated 18 of 20 Tree A simple connected graph with no cycles. 19 of 20 Walk A sequence of arcs in which the end of each arc (except the last) is the beginning of the next 20 of 20
Comments
No comments have yet been made