D1 Definitions 5.0 / 5 based on 5 ratings ? MathematicsD1ASEdexcel Created by: GinaCreated on: 22-05-15 11:09 429835617 Across 1. All the valencies are even- graph is transversable (8, 5) 4. Two vertices are 'connected' if there is a path between them. A graph is connected if all of it's vertices are connected (9) 5. A finite sequence of edges, such that the end vertex of one edge in the sequence is the start vertex of the next, and no vertex appears more than once (4) 6. A graph in which the edges have a direction associated with them- edges are directed edges (7) 7. A graph consists of vertices (nodes) which are connected by edges (5) 8. A closed path i.e.the end vertex of the last edge is the starting vertex of the first edge (5) 9. a matching in which the number of arcs is as large as possible (7, 8) Down 2. A matrix which records the weights on the edges, No weight is indicated by '-' (8, 6) 3. A graph consisting of 2 sets of vertices, X and Y. the edges only join vertices in X to vertices in Y, not vertices within the same set (9, 5) 4. 1 to 1 pairing of all the elements in set X, with elements of set Y, in a bipartite graph (8, 8)
Comments
No comments have yet been made