<｜begin▁of▁sentence｜>### Instruction:
Can you generate the Trivial graph, which is a graph consisting of a single node with no edges, using NetworkX?
### Response:
import networkx as nx

# Generate the Trivial graph with one node and no edges
G = nx.trivial_graph()

# Print information about the created graph
print(nx.info(G))
<|EOT|>
