Educative Site Free Online Academic Courses Tutorials, Books with enough questions and answers
Complete Graph
A complete graph is a graph that has an edge between every two vertices. If vertices is n, then edges = n(n-1)/2.
Example, vertices = 5; then edges = 5(5-1)/2 = 10.
Fig: A complete Graph
A complete graph is a graph that has an edge between every two vertices. If vertices is n, then edges = n(n-1)/2.
Example, vertices = 5; then edges = 5(5-1)/2 = 10.
Fig: A complete Graph