Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Hamming_graph> ?p ?o. }
Showing items 1 to 30 of
30
with 100 items per page.
- Hamming_graph abstract "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.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.".
- Hamming_graph wikiPageExternalLink Hamming.html.
- Hamming_graph wikiPageID "8046549".
- Hamming_graph wikiPageRevisionID "575402267".
- Hamming_graph hasPhotoCollection Hamming_graph.
- Hamming_graph id "HammingGraph".
- Hamming_graph name "Hamming graph".
- Hamming_graph namesake Richard_Hamming.
- Hamming_graph notation "H".
- Hamming_graph properties Distance-regular_graph.
- Hamming_graph properties Regular_graph.
- Hamming_graph properties Vertex-transitive_graph.
- Hamming_graph title "Hamming Graph".
- Hamming_graph subject Category:Parametric_families_of_graphs.
- Hamming_graph subject Category:Regular_graphs.
- Hamming_graph type Abstraction100002137.
- Hamming_graph type Communication100033020.
- Hamming_graph type Graph107000195.
- Hamming_graph type RegularGraphs.
- Hamming_graph type VisualCommunication106873252.
- Hamming_graph comment "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.".
- Hamming_graph label "Graphe de Hamming".
- Hamming_graph label "Hamming graph".
- Hamming_graph sameAs Graphe_de_Hamming.
- Hamming_graph sameAs m.026pn1c.
- Hamming_graph sameAs Q369440.
- Hamming_graph sameAs Q369440.
- Hamming_graph sameAs Hamming_graph.
- Hamming_graph wasDerivedFrom Hamming_graph?oldid=575402267.
- Hamming_graph isPrimaryTopicOf Hamming_graph.