<｜begin▁of▁sentence｜>### Instruction:
What is the number of nodes and edges in the Chvátal Graph, and is it a Hamiltonian graph?
### Response:
import networkx as nx

# Use the chvatal_graph constructor
g = nx.chvatal_graph()

# Print the number of nodes and edges in the Chvátal Graph
print('Number of nodes:', g.number_of_nodes())
print('Number of edges:', g.number_of_edges())

# Check if the graph is Hamiltonian (since the Chvátal Graph is known to be Hamiltonian)
# by checking if there is a Hamiltonian cycle
path = nx.is_hamiltonian(g)
print('Is the graph Hamiltonian?:', path)
<|EOT|>
