<｜begin▁of▁sentence｜>### Instruction:
Given a graph with vertex set {0, 1, 2, 3} and edge set {(0, 1), (1, 2), (2, 3), (3, 0), (0, 2), (1, 3)}, how would you compute the small-world coefficient (sigma) using NetworkX to determine if the graph exhibits small-world properties?
### Response:
import networkx as nx
from networkx.algorithms import smallworld

# Create an undirected graph
G = nx.Graph()
G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0), (0, 2), (1, 3)])

# Compute the small-world coefficient (sigma)
sigma_value = smallworld.sigma(G, niter=100, nrand=10, seed=42)

print('Small-world coefficient (sigma):', sigma_value)
<|EOT|>
