Hamming graph
= Hamming graph
{wiki=Hamming_graph}
A Hamming graph, denoted as \\( H(n, d) \\), is a type of graph that represents the relationships between binary strings of a certain length and the Hamming distance between them. Specifically, the Hamming graph \\( H(n, d) \\) is defined as follows: - **Vertices**: Each vertex corresponds to a binary string of length \\( n \\).