def fibG(n):
    G = Graph()
    fib = set(fibonacci_sequence(2*n))
    for i,j in combinations(range(1,n+1),2):
        if i+j in fib:
            G.add_edge(i,j)
    return G