Far Graphs

Consider a positive even integer L and N distinct integers a1, a2, ..., aN such that | ai - aj | ≤ L for all 1 ≤ i, j ≤ N. Now, we define a far graph induced by L and a1..N as a graph with N vertices (numbered 1 through N) satisfying the following condition: for each pair of vertices u and v, there is an undirected edge between u and v if and only if | au - av | ≥ L/2. Given a simple graph G, you