how can we draw n^2 edge in graph n is node
according we uni-directed graph n=4 then
edge is node greater than 12
but prateek bhaiya say edge is less or equal to n^2
Graphs 02 : Representation (YT)
Hi @khemchandrs
There is no graph of n nodes which can have n^2 edges. Dont get confused what you are saying is right but Prateek bhaiya has mentioned that total possible edges in complete graph is nC2 which is (n*(n-1))/2 which he has represented in big oh notation according to which nC2 = O(n^2).
Directed graph : maximum number of edges is nn-1
Undirected graph : maximum number of edges is (n(n-1))/2