Graph Theory 37. Which Graphs are Trees

A proof that a graph of order n is a tree if and only if it is has no cycle and has n-1 edges. An introduction to Graph Theory by Dr. Sarada Herke. Related Videos:    • Graph Theory: 36. Definition of a Tree   - Graph Theory: 36. Definition of a Tree    • Graph Theory: 38. Three ways to Identify T...   - Graph Theory: 38. Three ways to Identify Trees    • Graph Theory: 17. Distance Between Vertice...   - Graph Theory: 17. Distance Between Vertices and Connected Components For quick videos about Math tips and useful facts, check out my other channel "Spoonful of Maths" -    / spoonfulofmaths