D1 terms 5.0 / 5 based on 1 rating ? MathematicsNetworks, algorithms and problem solvingASEdexcel Created by: chickpeatweetCreated on: 10-04-15 14:26 97352186410 Across 1. A connected graph with no cycles (4) 4. Connected graph with no cycles where all vertices are connected (8, 4) 5. In a eulerian graph, all the vertexs have an ..... degree (4) 6. A closed path, in which you start and finish at same place (5) 9. Graph in which all vertices are connected (9, 5) 10. A route where you can revisit a vertex (4) Down 2. A route which only visits each vertex once (4) 3. Can travel along each edge once but start and finish different places (4, 8) 7. The number of edges leaving a vertex (6) 8. Is traversable, can travel along each edge once and return to start (8)
Comments
No comments have yet been made