<｜begin▁of▁sentence｜>### Instruction:
Given an undirected graph with edges defined in a list, can you use the canonical_permutation function in igraph to find and print the canonical permutation of its vertices using the BLISS isomorphism algorithm?
### Response:
from igraph import Graph

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

# Find the canonical permutation
permutation = g.canonical_permutation()

# Print the permutation
print('Canonical permutation:', permutation)
<|EOT|>
