<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with specified edges, can you use the independence_number function to find the size of the largest independent vertex set?
### Response:
from igraph import Graph

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

# Calculate the independence number of the graph
independence_num = g.independence_number()

# Print the independence number
print(f'The independence number of the graph is: {independence_num}')
<|EOT|>
