<｜begin▁of▁sentence｜>### Instruction:
Given an unweighted undirected graph with the edge set [(0, 1), (1, 2), (2, 0), (1, 3), (3, 4), (4, 5), (3, 5)], can you calculate the average local transitivity (clustering coefficient) of the graph, treating vertices with degree less than two with zero transitivity?
### Response:
from igraph import Graph, mean

# Create an unweighted undirected graph
g = Graph(edges=[(0, 1), (1, 2), (2, 0), (1, 3), (3, 4), (4, 5), (3, 5)], directed=False)

# Calculate the local transitivity for all vertices
t_local = g.transitivity_local_undirected(vertices=None, mode='zero')

# Print the average local transitivity
print('Average local transitivity:', mean(t_local))
<|EOT|>
