<｜begin▁of▁sentence｜>### Instruction:
Given a dodecahedral graph, which is a distance-regular graph, how can we determine its global parameters using NetworkX, considering the intersection array [b_0, b_1, ..., b_{d-1}; c_1, c_2, ..., c_d] with constraints a_i + b_i + c_i = k, where k is the degree of every vertex?
### Response:
import networkx as nx

# Create a distance-regular graph, for example, a dodecahedral graph
G = nx.dodecahedral_graph()

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

# Compute the global parameters based on the intersection array
parameters = list(nx.global_parameters(b, c))
print(parameters)
<|EOT|>
