Theorem - Maximum Number of Edges in Simple Graph is n(n-1)/2 | By :- Harendra Sharma

In this lecture we are going to prove on theorem i.e Maximum Number of Edges in Simple Graph is n(n-1)/2 with n- vertices we proof this theorem by simple way and also with an example #MaximumNumberOfEdgesInSimpleGraphisn(n-1)/2 #Theorem #GaphTheory For more videos Subscribe Bhai Bhai Tutorials By- Harendra Sharma