Hamming graph
id:
hamming-graph-295-8102066
title:
Hamming graph
text:
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
brand slug:
wiki
category slug:
encyclopedia
description:
Cartesian product of complete graphs
original url:
https://en.wikipedia.org/wiki/Hamming_graph
date created:
date modified:
2023-12-02T19:06:06Z
main entity:
{"identifier":"Q369440","url":"https://www.wikidata.org/entity/Q369440"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/06/Hamming_3-3_unit_distance.svg","width":1174,"height":1192}
fields total:
13
integrity:
15