<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edges [(1, 2), (2, 3), (3, 4), (4, 5), (5, 1), (3, 5)], what is the minimum maximal matching using NetworkX?
### Response:
import networkx as nx

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

# Find the minimum maximal matching
matching = nx.min_maximal_matching(G)

print('Minimum maximal matching:', matching)
<|EOT|>
