Across
- 3. a walk with no repeated vertices
- 5. A cycle that contains every edge of the main graph i.e a spanning cycle
- 8. A circuit that contains every edge of the main graph
- 9. number of vertices in a graph
- 10. Distinct edges with a common vertex
Down
- 1. a finite non empty set of objects called vertices and a set of objects called edges
- 2. All vertices are adjacent in this graph
- 4. a graph with order 1 or walk of length zero
- 6. Connected graph with no cycles
- 7. number of edges on a vertex