Decision 1 cards 3.0 / 5 based on 1 rating ? MathematicsNetworks, algorithms and problem solvingA2/A-levelAQA Created by: SaraCreated on: 20-04-13 16:25 Simple Graph A graph that has no loops and at most one edge connects any pair of vertices 1 of 15 Trail Sequence of edges where the end vertex of one edge is the start vertex of the next 2 of 15 Closed Trail A trail where you return to the initial vertex at the end 3 of 15 Path A trail where no vertex is visited for the second time 4 of 15 Cycle A path where you return to the initial vertex at the end 5 of 15 Eularian Graph A connected graph which has a closed trail connecting every edge exactly once (Only if every vertex has an even order) 6 of 15 Semi-Eularian Graph A graph which has a trail which is not closed that contains every edge exactly once 7 of 15 Weighted Graph A graph which has a number linked to each edge 8 of 15 Directed Graph A graph which has a direction associated with at least some of the edges 9 of 15 Connected Graph A graph where a path can be found connecting any 2 vertices 10 of 15 Complete Graph A graph where every vertex is connected to every other vertex by exactly one edge (1/2n(n-1)) 11 of 15 Bipartite Graph The vertices are in 2 sets and the edges only join a vertices in different sets 12 of 15 Tree A connected graph with no cycles 13 of 15 Hamiltonian Cycle A cycle that visits every vertex of a graph 14 of 15 Adjacency Matrix A table that shows the weights or directions on a graph 15 of 15
Comments
No comments have yet been made