Definition:Ore Graph

Definition
Let $G = \struct {V, E}$ be an undirected simple graph.

Then $G$ 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$.

That is, :
 * $\forall u, v \in V: \set {u, v} \notin E \implies \map {\deg_G} u + \map {\deg_G} v \ge \card V$

Also see

 * Ore's Theorem