#Algorithms How is this equivalent in Kruskal's Algorithm's Time Complexity?

Question

Kruskal Time complexity is  O(mlog m) then how in upper bound it can be written as - 

O(m2) ----> How log m = O(m)

and 

O (mn) ---------> How log n = O(n)

Answer 1

O(mlogm) is tightest upper bound of kruskal algorithm.

Comments

@abhishekmehta4u What if, it would be omega then can we write logm > = c. m and again logm = omega(m)

---

no

simplly A------>$\Omega (B)$ means B is smaller from A.

HERE logm----->$\Omega (m)$ and m is not smaller from logm so it is false .

EXAMPLE

---

Thanks a lot, really helpful.