Given an undirected graph $G$, where n denotes the number of vertices and m denotes the number of edges ($m \gg n$). Which of the following statement(s) is (are) true about the graph $G$?