<｜begin▁of▁sentence｜>### Instruction:
{'Description': 'Given a graph whose edge set is [(1, 2), (1, 3), (2, 3), (3, 4), (3, 5)], how do you generate the complement of this graph using NetworkX?', 'Problem': 'The code computes the complement of a given graph G, which consists of the edges not present in the original graph. The result does not include self-loops or parallel edges for MultiGraphs, and no graph, node, or edge data from the original graph is carried over to the new graph.'}
### Response:
import networkx as nx

# Create a graph G
G = nx.Graph([(1, 2), (1, 3), (2, 3), (3, 4), (3, 5)])

# Get the complement of G
G_complement = nx.complement(G)

# Print the edges of the complemented graph
print(G_complement.edges())
<|EOT|>
