<｜begin▁of▁sentence｜>### Instruction:
Can you generate a k-regular undirected graph with 10 vertices, where each vertex has a degree of 3, and print the adjacency list to show its connections?
### Response:
from igraph import Graph

# Generate a k-regular undirected graph with 10 vertices, each with degree 3
k_regular_graph = Graph.K_Regular(10, 3, directed=False, multiple=False)

# print the adjacency list to show connections
print(k_regular_graph.get_adjlist())
<|EOT|>
