"biconnected" meaning in English

See biconnected in All languages combined, or Wiktionary

Adjective

Etymology: bi- + connected Etymology templates: {{prefix|en|bi|connected}} bi- + connected Head templates: {{en-adj|-}} biconnected (not comparable)
  1. (graph theory) Describing a connected graph from which two vertices must be removed for it to become disconnected. Tags: not-comparable Categories (topical): Graph theory Related terms: biconnectivity
    Sense id: en-biconnected-en-adj-q~s9SOEF Categories (other): English entries with incorrect language header, English terms prefixed with bi- Topics: graph-theory, mathematics, sciences

Download JSON data for biconnected meaning in English (1.4kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "bi",
        "3": "connected"
      },
      "expansion": "bi- + connected",
      "name": "prefix"
    }
  ],
  "etymology_text": "bi- + connected",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "biconnected (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 bi-",
          "parents": [],
          "source": "w"
        },
        {
          "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"
        }
      ],
      "glosses": [
        "Describing a connected graph from which two vertices must be removed for it to become disconnected."
      ],
      "id": "en-biconnected-en-adj-q~s9SOEF",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "connected graph",
          "connected graph"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "disconnected",
          "disconnected"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Describing a connected graph from which two vertices must be removed for it to become disconnected."
      ],
      "related": [
        {
          "word": "biconnectivity"
        }
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "biconnected"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "bi",
        "3": "connected"
      },
      "expansion": "bi- + connected",
      "name": "prefix"
    }
  ],
  "etymology_text": "bi- + connected",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "biconnected (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "related": [
    {
      "word": "biconnectivity"
    }
  ],
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms prefixed with bi-",
        "English uncomparable adjectives",
        "en:Graph theory"
      ],
      "glosses": [
        "Describing a connected graph from which two vertices must be removed for it to become disconnected."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "connected graph",
          "connected graph"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "disconnected",
          "disconnected"
        ]
      ],
      "raw_glosses": [
        "(graph theory) Describing a connected graph from which two vertices must be removed for it to become disconnected."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "biconnected"
}

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.