<｜begin▁of▁sentence｜>### Instruction:
Given a graph whose edge set is [(1, 2), (1, 5), (1, 8), (2, 3), (2, 8), (3, 4), (3, 6), (4, 5), (4, 7), (5, 6), (6, 7), (7, 8)], can you compute the subgraph centrality for each node using NetworkX?
### Response:
import networkx as nx

# Creating a graph
G = nx.Graph()
G.add_edges_from([(1, 2), (1, 5), (1, 8), (2, 3), (2, 8), (3, 4), (3, 6), (4, 5), (4, 7), (5, 6), (6, 7), (7, 8)])

# Calculating subgraph centrality
sc = nx.subgraph_centrality(G)

# Displaying subgraph centrality for each node
print({node: f'{centrality:0.2f}' for node, centrality in sc.items()})
<|EOT|>
