<｜begin▁of▁sentence｜>### Instruction:
You have an icosahedral graph, which is a distance-regular graph. How would you compute the intersection array of this graph using NetworkX? The graph has 12 vertices and 30 edges, forming a regular polyhedron with 20 equilateral triangle faces.
### Response:
import networkx as nx

# Create an icosahedral graph (which is known to be distance-regular)
G = nx.icosahedral_graph()

# Get the intersection array of the graph
b, c = nx.intersection_array(G)

print('The intersection array is:', (b, c))
<|EOT|>
