<｜begin▁of▁sentence｜>### Instruction:
Given a graph with its edge set as [(1, 2), (2, 3), (3, 4), (4, 1), (1, 3), (2, 4)], can you determine if the graph is a 3-regular graph using NetworkX?
### Response:
import networkx as nx

# Create a graph
G = nx.Graph()
G.add_edges_from([(1, 2), (2, 3), (3, 4), (4, 1), (1, 3), (2, 4)])

# Determine if the graph is k-regular
k = 3
is_k_reg = nx.is_k_regular(G, k)

print(f'Is the graph k-regular with k={k}:', is_k_reg)
<|EOT|>
