Graph Theory 1.0 / 5 MathematicsGraphs and transformationsASAQA Created by: HarryCreated on: 09-05-13 20:15 What is the definition of a graph? A finite number of points (nodes) all connected by lines. 1 of 9 A graph is connected if... all pairs of vertices are connected 2 of 9 If a graph has directed edges we do not call it a... directional graph 3 of 9 A completed graph is a... graph in which every vertex is connected by an edge to each of the other vertex 4 of 9 If a completed graph has n vertices, how many edges does it have? n-1 5 of 9 What is a Hamiltonian cycle? A cycle that visits every vertex of a grpah 6 of 9 What is a cycle A closed path with at least one edge 7 of 9 What is a Trail A sequence of edges of a graph such that the second vertex of each edge is the first vertex of the next edge, with no edge included more than once. 8 of 9 What is a Path A trail such that no vertex is visited more than once 9 of 9

## Comments

No comments have yet been made