#Graph Theory #Algorithms Self Doubt about Dense Graphs.

Question

Please give some example regarding number of edges in dense graph is - 

|E| < |V2|

I get that when we take log both sides we get O(ElogV), but I can't get this |E| < |V2|

Answer 1

we get relation logE= O(logV)

Comments

You always have a pen and paper, handy! Awesome stuff @abhishekmehta4u

@eyeamgj Thanks! :)

---

LOG(E) != LOG(V)

O(LOG(E)) = O(LOG(V))

Answer 2

the number of edges in a graph is less than or equal to (v(v-1))/2.......i.e number of edeges in complete graph with v vertices...so it will be |E|= O(V² )...........