<｜begin▁of▁sentence｜>### Instruction:
Given a list of vertex degrees as [3, 3, 2, 2, 2] for an undirected graph without loop or multiple edges, can you use the is_graphical function in igraph to determine if this degree sequence is graphical (i.e., if there exists a corresponding graph)?
### Response:
from igraph import Graph

# List of degrees (out-degrees if directed, otherwise just degrees)
out_deg = [3, 3, 2, 2, 2]
# Since it's an undirected graph, in_deg remains None
in_deg = None

# Set to True if loop edges are allowed, otherwise False
loops = False
# Set to True if multiple edges are allowed, otherwise False
multiple = False

# Check if the sequence can correspond to some graph
is_possible = Graph.is_graphical(out_deg, in_deg, loops, multiple)
print('Is the degree sequence graphical?:', is_possible)
<|EOT|>
