GRAPH THEORY

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