See windmill graph on Wiktionary
{
"etymology_text": "From the visual resemblance to the sails of a windmill.",
"forms": [
{
"form": "windmill graphs",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "windmill graph (plural windmill graphs)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "other",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [],
"source": "w"
}
],
"glosses": [
"The undirected graph Wd(k,n) constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kₖ at a shared universal vertex."
],
"id": "en-windmill_graph-en-noun-eH7RHr34",
"links": [
[
"graph theory",
"graph theory"
],
[
"undirected graph",
"undirected graph"
],
[
"complete graph",
"complete graph"
],
[
"universal",
"universal"
],
[
"vertex",
"vertex"
]
],
"raw_glosses": [
"(graph theory) The undirected graph Wd(k,n) constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kₖ at a shared universal vertex."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "windmill graph"
}
{
"etymology_text": "From the visual resemblance to the sails of a windmill.",
"forms": [
{
"form": "windmill graphs",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "windmill graph (plural windmill graphs)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Graph theory"
],
"glosses": [
"The undirected graph Wd(k,n) constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kₖ at a shared universal vertex."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"undirected graph",
"undirected graph"
],
[
"complete graph",
"complete graph"
],
[
"universal",
"universal"
],
[
"vertex",
"vertex"
]
],
"raw_glosses": [
"(graph theory) The undirected graph Wd(k,n) constructed for k ≥ 2 and n ≥ 2 by joining n copies of the complete graph Kₖ at a shared universal vertex."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"word": "windmill graph"
}
Download raw JSONL data for windmill graph meaning in All languages combined (1.1kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2025-06-01 from the enwiktionary dump dated 2025-05-20 using wiktextract (3dadd05 and f1c2b61). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.