<｜begin▁of▁sentence｜>### Instruction:
Given an icosahedral graph (a polyhedron with 20 vertices, 30 edges and 12 faces), can you compute the minimum number of nodes that must be removed to disconnect node 0 from node 6 using NetworkX's minimum_st_node_cut function?
### Response:
import networkx as nx
from networkx.algorithms.connectivity import minimum_st_node_cut

# Create a graph
G = nx.icosahedral_graph()

# Compute the minimum node cut
node_cut = minimum_st_node_cut(G, 0, 6)

print('Minimum node cut to disconnect node 0 from node 6:', node_cut)
print('Number of nodes in the cut set:', len(node_cut))
<|EOT|>
