Named after Richard Hamming | ||
 | ||
Vertices q
d
{displaystyle q^{d}} Edges d
(
q
−
1
)
q
d
2
{displaystyle { rac {d(q-1)q^{d}}{2}}} Diameter d
{displaystyle d} Spectrum {
(
d
(
q
−
1
)
−
q
i
)
(
d
i
)
(
q
−
1
)
i
;
i
=
0
,
…
,
d
}
{displaystyle {(d(q-1)-qi)^{{inom {d}{i}}(q-1)^{i}};i=0,ldots ,d}} Properties d
(
q
−
1
)
{displaystyle d(q-1)}
-regular
Vertex-transitive
Distance-regular | ||
Hamming graphs are a special class of graphs named after Richard Hamming and used in several branches of mathematics and computer science. Let S be a set of q elements and d a positive integer. The Hamming graph H(d,q) has vertex set Sd, the set of ordered d-tuples of elements of S, or sequences of length d from S. Two vertices are adjacent if they differ in precisely one coordinate; that is, if their Hamming distance is one. The Hamming graph H(d,q) is, equivalently, the Cartesian product of d complete graphs Kq.
Contents
In some cases, Hamming graphs may be considered more generally as the Cartesian products of complete graphs that may be of varying sizes. Unlike the Hamming graphs H(d,q), the graphs in this more general class are not necessarily distance-regular, but they continue to be regular and vertex-transitive.
Special Cases
Applications
The Hamming graphs are interesting in connection with error-correcting codes and association schemes, to name two areas. They have also been considered as a communications network topology in distributed computing.
Computational complexity
It is possible to test whether a graph is a Hamming graph, and in the case that it is find a labeling of it with tuples that realizes it as a Hamming graph, in linear time.