Keller graph
Keller graph noun: any of a certain family of graphs related to Keller's conjecture, such that the vertices of the Keller graph of dimension n are the 4ⁿ elements (m₁,...,mₙ) where each m is 0, 1, 2, or 3, and two vertices are joined by an edge if they differ in at least two coordinates and differ by exactly two in at least one coordinate.
Noun
Keller graph (plural Keller graphs)
- Any of a certain family of graphs related to Keller's conjecture, such that the vertices of the Keller graph of dimension n are the 4ⁿ elements (m₁,...,mₙ) where each m is 0, 1, 2, or 3, and two vertices are joined by an edge if they differ in at least two coordinates and differ by exactly two in at least one coordinate.
Forms of Keller graph
| plural | Keller graphs |
|---|
Origin of Keller graph
Named after Ott-Heinrich Keller.
Questions about Keller graph
- What does Keller graph mean?
- Keller graph means any of a certain family of graphs related to Keller's conjecture, such that the vertices of the Keller graph of dimension n are the 4ⁿ elements (m₁,...,mₙ) where each m is 0, 1, 2, or 3, and two vertices are joined by an edge if they differ in at least two coordinates and differ by exactly two in at least one coordinate.
- What part of speech is Keller graph?
- Keller graph is a noun.
- What is the plural of Keller graph?
- The plural of Keller graph is Keller graphs.
Words near Keller graph in the dictionary
Source and license
Adapted from Wiktionary: Keller graph (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Keller graph.” Word.ws, https://word.ws/keller_graph. Based on Wiktionary, CC BY-SA 4.0.
