Across
- 3. A circuit which traverse each edge in the graph once
- 5. A graph with direction assigned to edges
- 8. A vertex with no edges incident
- 9. A graph in which all verteices are of equal degree
- 11. Lenght of.....is the number of edges it contains
- 12. Minimum number to colour a graph
- 13. Connected graph without any circuit
- 14. A graph with neither self loop nor parallel edges
Down
- 1. A graph with vertices and without edges
- 2. A vertex with zero indegree
- 4. A graph without direction assigned to edges
- 6. A graph whose every two vertices have a path
- 7. A Vertex of order one
- 10. Collection of trees