"intervertex" meaning in English

See intervertex in All languages combined, or Wiktionary

Adjective

Rhymes: -ɜː(ɹ)tɛks Etymology: inter- + vertex Etymology templates: {{prefix|en|inter|vertex}} inter- + vertex Head templates: {{en-adj|-}} intervertex (not comparable)
  1. Between vertices. Tags: not-comparable
    Sense id: en-intervertex-en-adj-hETu-2g7 Categories (other): English entries with incorrect language header, English terms prefixed with inter-

Download JSON data for intervertex meaning in English (1.2kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "inter",
        "3": "vertex"
      },
      "expansion": "inter- + vertex",
      "name": "prefix"
    }
  ],
  "etymology_text": "inter- + vertex",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "intervertex (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with inter-",
          "parents": [],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2016, Sergey Melnik, James P. Gleeson, “Simple and accurate analytical calculation of shortest path lengths”, in arXiv",
          "text": "We present an analytical approach to calculating the distribution of shortest paths lengths (also called intervertex distances, or geodesic paths) between nodes in unweighted undirected networks.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Between vertices."
      ],
      "id": "en-intervertex-en-adj-hETu-2g7",
      "links": [
        [
          "vertices",
          "vertex"
        ]
      ],
      "tags": [
        "not-comparable"
      ]
    }
  ],
  "sounds": [
    {
      "rhymes": "-ɜː(ɹ)tɛks"
    }
  ],
  "word": "intervertex"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "inter",
        "3": "vertex"
      },
      "expansion": "inter- + vertex",
      "name": "prefix"
    }
  ],
  "etymology_text": "inter- + vertex",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "intervertex (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms prefixed with inter-",
        "English terms with quotations",
        "English uncomparable adjectives",
        "Rhymes:English/ɜː(ɹ)tɛks",
        "Rhymes:English/ɜː(ɹ)tɛks/4 syllables"
      ],
      "examples": [
        {
          "ref": "2016, Sergey Melnik, James P. Gleeson, “Simple and accurate analytical calculation of shortest path lengths”, in arXiv",
          "text": "We present an analytical approach to calculating the distribution of shortest paths lengths (also called intervertex distances, or geodesic paths) between nodes in unweighted undirected networks.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Between vertices."
      ],
      "links": [
        [
          "vertices",
          "vertex"
        ]
      ],
      "tags": [
        "not-comparable"
      ]
    }
  ],
  "sounds": [
    {
      "rhymes": "-ɜː(ɹ)tɛks"
    }
  ],
  "word": "intervertex"
}

This page is a part of the kaikki.org machine-readable English dictionary. This dictionary is based on structured data extracted on 2024-05-05 from the enwiktionary dump dated 2024-05-02 using wiktextract (f4fd8c9 and c9440ce). 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.