<｜begin▁of▁sentence｜>### Instruction:
Given a Petersen graph, which is known for its triconnected properties, can you determine the k-component structure of the graph to identify its inherent hierarchical connectivity?
### Response:
import networkx as nx

# Create a Petersen graph
G = nx.petersen_graph()

# Calculate k-components
k_components = nx.k_components(G)

# Output the k-components structure
for k, components in k_components.items():
    print(f'{k}-components:', components)
<|EOT|>
