Definition:Ore Graph

Definition
An undirected simple graph $G = \left({V, E}\right)$ is an Ore Graph :
 * the sum of the degrees of every pair of non-adjacent vertices is greater than or equal to the order of $G$:


 * $\forall u, v \in V, \left\{ {u, v}\right\} \notin E \implies \deg_G \left({u}\right) + \deg_G \left({v}\right) \ge \left|{V}\right|$