"bidegreed" meaning in All languages combined

See bidegreed on Wiktionary

Adjective [English]

Head templates: {{en-adj|-}} bidegreed (not comparable)
  1. (mathematics, of a graph) Whose vertices have exactly two degrees Tags: not-comparable Categories (topical): Mathematics
    Sense id: en-bidegreed-en-adj-xW4HtYPA Categories (other): English entries with incorrect language header Topics: mathematics, sciences

Download JSON data for bidegreed meaning in All languages combined (1.3kB)

{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "bidegreed (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": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2015, Tamás Réti, Imre Felde, “Novel Zagreb Indices-Based Inequalities with Particular Regard to Semiregular and Generalized Semiregular Graphs”, in arXiv",
          "text": "Additionally, the notion of so called weakly semiregular graphs is introduced, they are considered as a possible generalization of traditional bidegreed semiregular graphs.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Whose vertices have exactly two degrees"
      ],
      "id": "en-bidegreed-en-adj-xW4HtYPA",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "degree",
          "degree"
        ]
      ],
      "raw_glosses": [
        "(mathematics, of a graph) Whose vertices have exactly two degrees"
      ],
      "raw_tags": [
        "of a graph"
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "bidegreed"
}
{
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "bidegreed (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 with quotations",
        "English uncomparable adjectives",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "2015, Tamás Réti, Imre Felde, “Novel Zagreb Indices-Based Inequalities with Particular Regard to Semiregular and Generalized Semiregular Graphs”, in arXiv",
          "text": "Additionally, the notion of so called weakly semiregular graphs is introduced, they are considered as a possible generalization of traditional bidegreed semiregular graphs.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "Whose vertices have exactly two degrees"
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "vertices",
          "vertex"
        ],
        [
          "degree",
          "degree"
        ]
      ],
      "raw_glosses": [
        "(mathematics, of a graph) Whose vertices have exactly two degrees"
      ],
      "raw_tags": [
        "of a graph"
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "bidegreed"
}

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-06-23 from the enwiktionary dump dated 2024-06-20 using wiktextract (1b9bfc5 and 0136956). 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.