<｜begin▁of▁sentence｜>### Instruction:
Given a graph with nodes labeled 1 to 5 and edges connecting node pairs (1,2), (2,3), (3,4), (4,5), and (5,1), what is a dominating set of this graph?
### Response:
# Example usage of dominating_set from NetworkX
import networkx as nx

# Create a graph
G = nx.Graph()

# Add nodes and edges
G.add_edges_from([(1,2), (2,3), (3,4), (4,5), (5,1)])

# Compute a dominating set
D = nx.dominating_set(G)

# Print the dominating set
print('Dominating Set:', D)
<|EOT|>
