"ultragraph" meaning in English

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "ultra",
        "3": "graph"
      },
      "expansion": "ultra- + graph",
      "name": "prefix"
    }
  ],
  "etymology_text": "From ultra- + graph.",
  "forms": [
    {
      "form": "ultragraphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "ultragraph (plural ultragraphs)",
      "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": "other",
          "name": "English terms prefixed with ultra-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2015, Daniel Gonçalves, Danilo Royer, “Ultragraphs and shifts over infinite alphabets”, in arXiv:",
          "text": "One of the key results needed in the proofs of our conclusions is the realization of a class of ultragraph C*-algebras as partial crossed products, a result of interest on its own..",
          "type": "quote"
        }
      ],
      "glosses": [
        "A generalization of a directed graph in which the source of an edge is a set of vertices rather than a single vertex."
      ],
      "id": "en-ultragraph-en-noun-FD861IoI",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "directed graph",
          "directed graph"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A generalization of a directed graph in which the source of an edge is a set of vertices rather than a single vertex."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "ultragraph"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "ultra",
        "3": "graph"
      },
      "expansion": "ultra- + graph",
      "name": "prefix"
    }
  ],
  "etymology_text": "From ultra- + graph.",
  "forms": [
    {
      "form": "ultragraphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "ultragraph (plural ultragraphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with ultra-",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Mathematics"
      ],
      "examples": [
        {
          "ref": "2015, Daniel Gonçalves, Danilo Royer, “Ultragraphs and shifts over infinite alphabets”, in arXiv:",
          "text": "One of the key results needed in the proofs of our conclusions is the realization of a class of ultragraph C*-algebras as partial crossed products, a result of interest on its own..",
          "type": "quote"
        }
      ],
      "glosses": [
        "A generalization of a directed graph in which the source of an edge is a set of vertices rather than a single vertex."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "directed graph",
          "directed graph"
        ]
      ],
      "raw_glosses": [
        "(mathematics) A generalization of a directed graph in which the source of an edge is a set of vertices rather than a single vertex."
      ],
      "topics": [
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "ultragraph"
}