<｜begin▁of▁sentence｜>### Instruction:
Consider a graph with nodes 0, 1, 2, and 3, and edges connecting them in a cycle: (0, 1), (1, 2), (2, 3), and (3, 0). What are the eigenvalues of the adjacency matrix of this graph?
### Response:
import networkx as nx
import numpy as np

# Create a graph
G = nx.Graph()

# Add nodes and edges to the graph
G.add_nodes_from([0, 1, 2, 3])
G.add_edges_from([(0, 1), (1, 2), (2, 3), (3, 0)])

# Calculate the eigenvalues of the adjacency matrix
eigenvalues = np.round(nx.adjacency_spectrum(G), 3)
print('The eigenvalues of the adjacency matrix are:', eigenvalues)
<|EOT|>
