<｜begin▁of▁sentence｜>### Instruction:
{'Description': 'Given a graph whose edge set is [(1, 2), (2, 3), (3, 4), (4, 5), (5, 1), (3, 5)], can you compute the core number for each vertex using NetworkX?', 'Problem': 'The code computes the core number of each node in an undirected graph. The core number is the largest value k of a k-core containing that node.'}
### 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)])

# Compute the core number for each vertex
core_nums = nx.core_number(G)

print(core_nums)
<|EOT|>
