<｜begin▁of▁sentence｜>### Instruction:
Given the Hoffman-Singleton Graph, a symmetrical undirected graph with 50 nodes and 175 edges, representing the only regular graph of vertex degree 7, diameter 2, and girth 5, how would you generate and obtain information about this graph using NetworkX?
### Response:
import networkx as nx

# Generate the Hoffman-Singleton Graph
G = nx.hoffman_singleton_graph()

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