<｜begin▁of▁sentence｜>### Instruction:
Given a graph with edges defined as pairs like [(0, 1), (0, 2), (1, 2), (2, 3), (3, 4), (4, 5), (5, 3)], can you determine if the graph will become disconnected by removing vertex 2 using the is_separator function from igraph?
### Response:
from igraph import Graph

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

# Vertices to test as a potential separator
separator = [2]

# Check if removing vertex 2 will disconnect the graph
is_sep = g.is_separator(separator)

print('Is separator:', is_sep)
<|EOT|>
