"cocktail party graph" meaning in All languages combined

See cocktail party graph on Wiktionary

Noun [English]

Forms: cocktail party graphs [plural]
Etymology: So called because it can be visualised as the set of handshakes if n couples go to a party and each person shakes hands with every person except his or her partner. Head templates: {{en-noun|head=cocktail party graph}} cocktail party graph (plural cocktail party graphs)
  1. (mathematics) A graph consisting of two rows of paired nodes in which all nodes except the paired ones are connected with straight lines; it is the complement of the ladder rung graph, and the dual graph of the hypercube. Categories (topical): Mathematics Synonyms: hyperoctahedral graph Hypernyms: Turán graph
    Sense id: en-cocktail_party_graph-en-noun-luyvRDgY Categories (other): English entries with incorrect language header Topics: mathematics, sciences

Inflected forms

Download JSON data for cocktail party graph meaning in All languages combined (1.7kB)

{
  "etymology_text": "So called because it can be visualised as the set of handshakes if n couples go to a party and each person shakes hands with every person except his or her partner.",
  "forms": [
    {
      "form": "cocktail party graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "cocktail party graph"
      },
      "expansion": "cocktail party graph (plural cocktail party graphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "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"
        }
      ],
      "glosses": [
        "A graph consisting of two rows of paired nodes in which all nodes except the paired ones are connected with straight lines; it is the complement of the ladder rung graph, and the dual graph of the hypercube."
      ],
      "hypernyms": [
        {
          "word": "Turán graph"
        }
      ],
      "id": "en-cocktail_party_graph-en-noun-luyvRDgY",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "row",
          "row"
        ],
        [
          "paired",
          "paired"
        ],
        [
          "node",
          "node"
        ],
        [
          "connected",
          "connected"
        ],
        [
          "complement",
          "complement"
        ],
        [
          "dual graph",
          "dual graph"
        ],
        [
          "hypercube",
          "hypercube"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A graph consisting of two rows of paired nodes in which all nodes except the paired ones are connected with straight lines; it is the complement of the ladder rung graph, and the dual graph of the hypercube."
      ],
      "synonyms": [
        {
          "word": "hyperoctahedral graph"
        }
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "cocktail party graph"
}
{
  "etymology_text": "So called because it can be visualised as the set of handshakes if n couples go to a party and each person shakes hands with every person except his or her partner.",
  "forms": [
    {
      "form": "cocktail party graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {
        "head": "cocktail party graph"
      },
      "expansion": "cocktail party graph (plural cocktail party graphs)",
      "name": "en-noun"
    }
  ],
  "hypernyms": [
    {
      "word": "Turán graph"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "en:Mathematics"
      ],
      "glosses": [
        "A graph consisting of two rows of paired nodes in which all nodes except the paired ones are connected with straight lines; it is the complement of the ladder rung graph, and the dual graph of the hypercube."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "row",
          "row"
        ],
        [
          "paired",
          "paired"
        ],
        [
          "node",
          "node"
        ],
        [
          "connected",
          "connected"
        ],
        [
          "complement",
          "complement"
        ],
        [
          "dual graph",
          "dual graph"
        ],
        [
          "hypercube",
          "hypercube"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A graph consisting of two rows of paired nodes in which all nodes except the paired ones are connected with straight lines; it is the complement of the ladder rung graph, and the dual graph of the hypercube."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "synonyms": [
    {
      "word": "hyperoctahedral graph"
    }
  ],
  "word": "cocktail party graph"
}

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-05-06 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.