{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nA universal graph is a graph that contains as subgraphs all graphs in a given family of graphs, or all graphs of a given size or order within a given family of graphs.\n\nA universal vertex (also called an apex or dominating vertex) is a vertex that is adjacent to every other vertex in the graph. For instance, wheel graphs and connected threshold graphs always have a universal vertex.\n\nIn the logic of graphs, a vertex that is universally quantified in a formula may be called a universal vertex for that formula.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "5F8N1NS1KG"
    ],
    "kind": "concept",
    "name": "Universal",
    "sources": [
      {
        "locator": "Glossary of graph theory, section U",
        "mention": "wikipedia://en/325802#16NX",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:325802@r1373839425"
      }
    ],
    "tag": "DPX08FCV5S"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/DPX08FCV5S/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/DPX08FCV5S.md",
  "msc": null,
  "name": "Universal",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/DPX/DPX08FCV5S.md",
  "status": null,
  "tag": "DPX08FCV5S",
  "uri": "m2://DPX08FCV5S",
  "url": "https://math2.tamnd.com/wiki/universal/",
  "writing": {
    "tag": "DPX08FCV5S",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}