<｜begin▁of▁sentence｜>### Instruction:
As a detective investigating a case involving network connections, you are tasked with creating a specific type of network graph using the NetworkX library. You need to generate a k-regular graph with a specified number of nodes and degree. After using the appropriate function to create the graph, you must also verify if the generated graph satisfies the k-regular condition. This will help in analyzing the connections and identifying any unusual patterns within the network.
### Response:
import igraph as ig

# Generate a k-regular graph with 10 nodes and each node with degree 3
k_value = 3
num_nodes = 10
g = ig.Graph.K_Regular(n=num_nodes, k=k_value)

# Check if the generated graph is indeed k-regular
is_k_regular = all(degree == k_value for degree in g.degree())
print('Is the generated graph k-regular?', is_k_regular)

# Print the edges of the generated k-regular graph
print('Edges of the generated graph:', g.get_edgelist())
<|EOT|>
