<｜begin▁of▁sentence｜>### Instruction:
Given a graph with 10 vertices, where vertices 0-3 form a clique and vertices 4-7 form another clique, with an edge connecting vertex 0 and vertex 4, can you determine the community structure using the leading eigenvector method?
### Response:
from igraph import Graph

# Create a simple graph with 10 vertices and edges forming two groups
g = Graph.Formula('0--1--2--3--0, 4--5--6--7--4, 0--4')

# Find the community structure using leading eigenvector method
communities = g.community_leading_eigenvector()

# Print the result
print('Memberships:', communities.membership)
print('Number of communities:', len(communities))
<|EOT|>
