<｜begin▁of▁sentence｜>### Instruction:
Given an adjacency matrix describing an undirected graph where the matrix element specifies the presence (1) or absence (0) of an edge between two vertices, can you use the Adjacency function from igraph to create the corresponding graph and print its summary?
### Response:
import igraph as ig

# Define the adjacency matrix for an undirected graph
adjacency_matrix = [
    [0, 1, 0, 1],
    [1, 0, 1, 0],
    [0, 1, 0, 1],
    [1, 0, 1, 0]
]

# Create the undirected graph from the adjacency matrix
graph = ig.Graph.Adjacency(adjacency_matrix, mode='undirected')

# Print the summary of the graph
g_summary = graph.summary()
print(g_summary)
<|EOT|>
