GRAPH THEORY

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