"arboricity" meaning in English

See arboricity in All languages combined, or Wiktionary

Noun

Audio: LL-Q1860 (eng)-Rho9998-arboricity.wav [UK] Forms: arboricities [plural]
Etymology: Latin arbor (“tree”) + -icity Etymology templates: {{der|en|la|arbor||tree}} Latin arbor (“tree”), {{af|en|-icity}} -icity Head templates: {{en-noun|~}} arboricity (countable and uncountable, plural arboricities)
  1. (graph theory) The minimum number of forests into which the edges of an undirected graph may be partitioned. Wikipedia link: arboricity Tags: countable, uncountable Categories (topical): Graph theory
    Sense id: en-arboricity-en-noun-7CjNqxUu Categories (other): English entries with incorrect language header, English terms suffixed with -icity Topics: graph-theory, mathematics, sciences

Inflected forms

Download JSON data for arboricity meaning in English (2.1kB)

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "la",
        "3": "arbor",
        "4": "",
        "5": "tree"
      },
      "expansion": "Latin arbor (“tree”)",
      "name": "der"
    },
    {
      "args": {
        "1": "en",
        "2": "-icity"
      },
      "expansion": "-icity",
      "name": "af"
    }
  ],
  "etymology_text": "Latin arbor (“tree”) + -icity",
  "forms": [
    {
      "form": "arboricities",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "arboricity (countable and uncountable, plural arboricities)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "antonyms": [
        {
          "word": "anarboricity"
        }
      ],
      "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 suffixed with -icity",
          "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": [
        "The minimum number of forests into which the edges of an undirected graph may be partitioned."
      ],
      "id": "en-arboricity-en-noun-7CjNqxUu",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "minimum",
          "minimum"
        ],
        [
          "number",
          "number"
        ],
        [
          "forest",
          "forest"
        ],
        [
          "edge",
          "edge"
        ],
        [
          "undirected graph",
          "undirected graph"
        ],
        [
          "partition",
          "partition"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The minimum number of forests into which the edges of an undirected graph may be partitioned."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "arboricity"
      ]
    }
  ],
  "sounds": [
    {
      "audio": "LL-Q1860 (eng)-Rho9998-arboricity.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/af/LL-Q1860_%28eng%29-Rho9998-arboricity.wav/LL-Q1860_%28eng%29-Rho9998-arboricity.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/af/LL-Q1860_%28eng%29-Rho9998-arboricity.wav/LL-Q1860_%28eng%29-Rho9998-arboricity.wav.ogg",
      "tags": [
        "UK"
      ],
      "text": "Audio (UK)"
    }
  ],
  "word": "arboricity"
}
{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "la",
        "3": "arbor",
        "4": "",
        "5": "tree"
      },
      "expansion": "Latin arbor (“tree”)",
      "name": "der"
    },
    {
      "args": {
        "1": "en",
        "2": "-icity"
      },
      "expansion": "-icity",
      "name": "af"
    }
  ],
  "etymology_text": "Latin arbor (“tree”) + -icity",
  "forms": [
    {
      "form": "arboricities",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "1": "~"
      },
      "expansion": "arboricity (countable and uncountable, plural arboricities)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "antonyms": [
        {
          "word": "anarboricity"
        }
      ],
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms derived from Latin",
        "English terms suffixed with -icity",
        "English terms with audio links",
        "English uncountable nouns",
        "en:Graph theory"
      ],
      "glosses": [
        "The minimum number of forests into which the edges of an undirected graph may be partitioned."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "minimum",
          "minimum"
        ],
        [
          "number",
          "number"
        ],
        [
          "forest",
          "forest"
        ],
        [
          "edge",
          "edge"
        ],
        [
          "undirected graph",
          "undirected graph"
        ],
        [
          "partition",
          "partition"
        ]
      ],
      "raw_glosses": [
        "(graph theory) The minimum number of forests into which the edges of an undirected graph may be partitioned."
      ],
      "tags": [
        "countable",
        "uncountable"
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "arboricity"
      ]
    }
  ],
  "sounds": [
    {
      "audio": "LL-Q1860 (eng)-Rho9998-arboricity.wav",
      "mp3_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/af/LL-Q1860_%28eng%29-Rho9998-arboricity.wav/LL-Q1860_%28eng%29-Rho9998-arboricity.wav.mp3",
      "ogg_url": "https://upload.wikimedia.org/wikipedia/commons/transcoded/a/af/LL-Q1860_%28eng%29-Rho9998-arboricity.wav/LL-Q1860_%28eng%29-Rho9998-arboricity.wav.ogg",
      "tags": [
        "UK"
      ],
      "text": "Audio (UK)"
    }
  ],
  "word": "arboricity"
}

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