See line graph on Wiktionary
{
"forms": [
{
"form": "line graphs",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "line graph (plural line graphs)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"categories": [
{
"_dis": "39 31 31",
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w+disamb"
},
{
"_dis": "32 34 34",
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "38 31 31",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "39 30 30",
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "36 32 32",
"kind": "other",
"name": "Terms with French translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "36 32 32",
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "40 30 30",
"kind": "other",
"name": "Terms with Japanese translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "36 32 32",
"kind": "other",
"name": "Terms with Korean translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "35 33 33",
"kind": "other",
"name": "Terms with Mandarin translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "35 32 32",
"kind": "other",
"name": "Terms with Portuguese translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "35 33 33",
"kind": "other",
"name": "Terms with Spanish translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "18 41 41",
"kind": "topical",
"langcode": "en",
"name": "Statistics",
"orig": "en:Statistics",
"parents": [
"Formal sciences",
"Mathematics",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w+disamb"
},
{
"_dis": "14 43 43",
"kind": "topical",
"langcode": "en",
"name": "Visualization",
"orig": "en:Visualization",
"parents": [
"Computing",
"Interdisciplinary fields",
"Technology",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w+disamb"
}
],
"glosses": [
"A graph in which a series of connected straight lines connect points, each of which represents the value of a particular variable as a function of another variable."
],
"id": "en-line_graph-en-noun-PodMxM9j",
"links": [
[
"graph",
"graph"
],
[
"straight line",
"straight line"
],
[
"point",
"point"
],
[
"value",
"value"
],
[
"variable",
"variable"
]
],
"synonyms": [
{
"word": "line chart"
}
],
"translations": [
{
"_dis1": "58 21 21",
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "line chart",
"word": "折線圖"
},
{
"_dis1": "58 21 21",
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "zhéxiàntú",
"sense": "line chart",
"word": "折线图"
},
{
"_dis1": "58 21 21",
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "line chart",
"word": "線形圖"
},
{
"_dis1": "58 21 21",
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "xiànxíngtú",
"sense": "line chart",
"word": "线形图"
},
{
"_dis1": "58 21 21",
"code": "de",
"lang": "German",
"sense": "line chart",
"tags": [
"neuter"
],
"word": "Liniendiagramm"
},
{
"_dis1": "58 21 21",
"alt": "おれせんグラフ",
"code": "ja",
"lang": "Japanese",
"roman": "oresen-gurafu",
"sense": "line chart",
"word": "折れ線グラフ"
},
{
"_dis1": "58 21 21",
"code": "ko",
"lang": "Korean",
"roman": "kkeokkeunseon geuraepeu",
"sense": "line chart",
"word": "꺾은선 그래프"
},
{
"_dis1": "58 21 21",
"code": "pt",
"lang": "Portuguese",
"sense": "line chart",
"tags": [
"masculine"
],
"word": "gráfico de linha"
}
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "32 34 34",
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "38 31 31",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "36 32 32",
"kind": "other",
"name": "Terms with French translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "36 32 32",
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "36 32 32",
"kind": "other",
"name": "Terms with Korean translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "35 33 33",
"kind": "other",
"name": "Terms with Mandarin translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "35 32 32",
"kind": "other",
"name": "Terms with Portuguese translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "35 33 33",
"kind": "other",
"name": "Terms with Spanish translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "18 41 41",
"kind": "topical",
"langcode": "en",
"name": "Statistics",
"orig": "en:Statistics",
"parents": [
"Formal sciences",
"Mathematics",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w+disamb"
},
{
"_dis": "14 43 43",
"kind": "topical",
"langcode": "en",
"name": "Visualization",
"orig": "en:Visualization",
"parents": [
"Computing",
"Interdisciplinary fields",
"Technology",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w+disamb"
}
],
"glosses": [
"A graph L(G) which is derived from a given non-oriented graph G such that the vertices of L(G) represent edges of G and so that a clique in L(G) represents a common end-vertex shared by a set of represented edges. (A star subgraph in G transforms into a clique in L(G).)"
],
"id": "en-line_graph-en-noun-rsiL~wnd",
"links": [
[
"graph theory",
"graph theory"
],
[
"clique",
"clique"
]
],
"raw_glosses": [
"(graph theory) A graph L(G) which is derived from a given non-oriented graph G such that the vertices of L(G) represent edges of G and so that a clique in L(G) represents a common end-vertex shared by a set of represented edges. (A star subgraph in G transforms into a clique in L(G).)"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
},
{
"categories": [
{
"kind": "topical",
"langcode": "en",
"name": "Graph theory",
"orig": "en:Graph theory",
"parents": [
"Mathematics",
"Visualization",
"Formal sciences",
"Computing",
"Interdisciplinary fields",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
},
{
"_dis": "32 34 34",
"kind": "other",
"name": "Entries with translation boxes",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "38 31 31",
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "36 32 32",
"kind": "other",
"name": "Terms with French translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "36 32 32",
"kind": "other",
"name": "Terms with German translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "36 32 32",
"kind": "other",
"name": "Terms with Korean translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "35 33 33",
"kind": "other",
"name": "Terms with Mandarin translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "35 32 32",
"kind": "other",
"name": "Terms with Portuguese translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "35 33 33",
"kind": "other",
"name": "Terms with Spanish translations",
"parents": [],
"source": "w+disamb"
},
{
"_dis": "18 41 41",
"kind": "topical",
"langcode": "en",
"name": "Statistics",
"orig": "en:Statistics",
"parents": [
"Formal sciences",
"Mathematics",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w+disamb"
},
{
"_dis": "14 43 43",
"kind": "topical",
"langcode": "en",
"name": "Visualization",
"orig": "en:Visualization",
"parents": [
"Computing",
"Interdisciplinary fields",
"Technology",
"Sciences",
"All topics",
"Fundamental"
],
"source": "w+disamb"
}
],
"examples": [
{
"text": "Suppose that a graph G has vertices A, B, C, and D such that A is adjacent to each of B, C, and D, but {B, C, D} is an independent set. Then G cannot be a line graph."
}
],
"glosses": [
"A graph L(G) which is derived from a given non-oriented graph G such that the vertices of L(G) represent edges of G and so that a clique in L(G) represents a common end-vertex shared by a set of represented edges. (A star subgraph in G transforms into a clique in L(G).)",
"A graph which is the line graph (in the above sense) of some other graph."
],
"id": "en-line_graph-en-noun-JpoW8h1F",
"links": [
[
"graph theory",
"graph theory"
],
[
"clique",
"clique"
]
],
"raw_glosses": [
"(graph theory) A graph L(G) which is derived from a given non-oriented graph G such that the vertices of L(G) represent edges of G and so that a clique in L(G) represents a common end-vertex shared by a set of represented edges. (A star subgraph in G transforms into a clique in L(G).)",
"A graph which is the line graph (in the above sense) of some other graph."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"translations": [
{
"_dis1": "2 49 49",
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "graph L(G)...",
"word": "線圖"
},
{
"_dis1": "2 49 49",
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "xiàntú",
"sense": "graph L(G)...",
"word": "线图"
},
{
"_dis1": "2 49 49",
"code": "fr",
"lang": "French",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "line graph"
},
{
"_dis1": "2 49 49",
"code": "fr",
"lang": "French",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "graphe adjoint"
},
{
"_dis1": "2 49 49",
"code": "de",
"lang": "German",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "Kantengraph"
},
{
"_dis1": "2 49 49",
"code": "es",
"lang": "Spanish",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "grafo línea"
},
{
"_dis1": "2 49 49",
"code": "es",
"lang": "Spanish",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "grafo de línea"
},
{
"_dis1": "2 49 49",
"code": "es",
"lang": "Spanish",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "grafo lineal"
},
{
"_dis1": "2 49 49",
"code": "es",
"lang": "Spanish",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "grafo representativo"
}
],
"wikipedia": [
"line chart",
"line graph"
],
"word": "line graph"
}
{
"categories": [
"English countable nouns",
"English entries with incorrect language header",
"English lemmas",
"English multiword terms",
"English nouns",
"Entries with translation boxes",
"Pages with 1 entry",
"Pages with entries",
"Terms with French translations",
"Terms with German translations",
"Terms with Japanese translations",
"Terms with Korean translations",
"Terms with Mandarin translations",
"Terms with Portuguese translations",
"Terms with Spanish translations",
"en:Statistics",
"en:Visualization"
],
"forms": [
{
"form": "line graphs",
"tags": [
"plural"
]
}
],
"head_templates": [
{
"args": {},
"expansion": "line graph (plural line graphs)",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "noun",
"senses": [
{
"glosses": [
"A graph in which a series of connected straight lines connect points, each of which represents the value of a particular variable as a function of another variable."
],
"links": [
[
"graph",
"graph"
],
[
"straight line",
"straight line"
],
[
"point",
"point"
],
[
"value",
"value"
],
[
"variable",
"variable"
]
],
"synonyms": [
{
"word": "line chart"
}
]
},
{
"categories": [
"en:Graph theory"
],
"glosses": [
"A graph L(G) which is derived from a given non-oriented graph G such that the vertices of L(G) represent edges of G and so that a clique in L(G) represents a common end-vertex shared by a set of represented edges. (A star subgraph in G transforms into a clique in L(G).)"
],
"links": [
[
"graph theory",
"graph theory"
],
[
"clique",
"clique"
]
],
"raw_glosses": [
"(graph theory) A graph L(G) which is derived from a given non-oriented graph G such that the vertices of L(G) represent edges of G and so that a clique in L(G) represents a common end-vertex shared by a set of represented edges. (A star subgraph in G transforms into a clique in L(G).)"
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
},
{
"categories": [
"en:Graph theory"
],
"examples": [
{
"text": "Suppose that a graph G has vertices A, B, C, and D such that A is adjacent to each of B, C, and D, but {B, C, D} is an independent set. Then G cannot be a line graph."
}
],
"glosses": [
"A graph L(G) which is derived from a given non-oriented graph G such that the vertices of L(G) represent edges of G and so that a clique in L(G) represents a common end-vertex shared by a set of represented edges. (A star subgraph in G transforms into a clique in L(G).)",
"A graph which is the line graph (in the above sense) of some other graph."
],
"links": [
[
"graph theory",
"graph theory"
],
[
"clique",
"clique"
]
],
"raw_glosses": [
"(graph theory) A graph L(G) which is derived from a given non-oriented graph G such that the vertices of L(G) represent edges of G and so that a clique in L(G) represents a common end-vertex shared by a set of represented edges. (A star subgraph in G transforms into a clique in L(G).)",
"A graph which is the line graph (in the above sense) of some other graph."
],
"topics": [
"graph-theory",
"mathematics",
"sciences"
]
}
],
"translations": [
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "line chart",
"word": "折線圖"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "zhéxiàntú",
"sense": "line chart",
"word": "折线图"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "line chart",
"word": "線形圖"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "xiànxíngtú",
"sense": "line chart",
"word": "线形图"
},
{
"code": "de",
"lang": "German",
"sense": "line chart",
"tags": [
"neuter"
],
"word": "Liniendiagramm"
},
{
"alt": "おれせんグラフ",
"code": "ja",
"lang": "Japanese",
"roman": "oresen-gurafu",
"sense": "line chart",
"word": "折れ線グラフ"
},
{
"code": "ko",
"lang": "Korean",
"roman": "kkeokkeunseon geuraepeu",
"sense": "line chart",
"word": "꺾은선 그래프"
},
{
"code": "pt",
"lang": "Portuguese",
"sense": "line chart",
"tags": [
"masculine"
],
"word": "gráfico de linha"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"sense": "graph L(G)...",
"word": "線圖"
},
{
"code": "cmn",
"lang": "Chinese Mandarin",
"roman": "xiàntú",
"sense": "graph L(G)...",
"word": "线图"
},
{
"code": "fr",
"lang": "French",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "line graph"
},
{
"code": "fr",
"lang": "French",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "graphe adjoint"
},
{
"code": "de",
"lang": "German",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "Kantengraph"
},
{
"code": "es",
"lang": "Spanish",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "grafo línea"
},
{
"code": "es",
"lang": "Spanish",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "grafo de línea"
},
{
"code": "es",
"lang": "Spanish",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "grafo lineal"
},
{
"code": "es",
"lang": "Spanish",
"sense": "graph L(G)...",
"tags": [
"masculine"
],
"word": "grafo representativo"
}
],
"wikipedia": [
"line chart",
"line graph"
],
"word": "line graph"
}
Download raw JSONL data for line graph meaning in All languages combined (4.8kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). 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.