<｜begin▁of▁sentence｜>### Instruction:
As a real estate agent, one of the tasks I handle is ensuring that the properties I represent are free from any legal complications that could affect their marketability. Similarly, in the world of graph theory and network analysis, ensuring that a graph is simple, meaning it has no loops or multiple edges, is an important step in determining its analytical value. If you provide me with the details of the graph edges, I can use the networkx Python library to check whether the graph is simple.
### Response:
from igraph import Graph

# Create a graph
edges = [(0, 1), (1, 2), (2, 3), (3, 0), (0, 2)]
g = Graph(edges)

# Check if the graph is simple
is_simple_graph = g.is_simple()
print('Graph is simple:', is_simple_graph)
<|EOT|>
