"medial graph" meaning in All languages combined

{
  "forms": [
    {
      "form": "medial graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "medial graph (plural medial 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": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "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"
        }
      ],
      "examples": [
        {
          "text": "The number of vertices of a medial graph is equal to the number of edges of its original graph, and the number of edges of a medial graph is equal to the sum of the degrees of the vertices of the original graph.",
          "type": "example"
        }
      ],
      "glosses": [
        "A graph derived from a given plane graph such that this derived graph has a vertex corresponding to each edge of the given graph, and such that for every “angle” (consecutive trio of edge, vertex, edge) along the border of a face of the given graph there is a corresponding edge which connects the vertices corresponding to the two edges that are part of that “angle”."
      ],
      "hypernyms": [
        {
          "word": "plane graph"
        },
        {
          "word": "regular graph"
        }
      ],
      "id": "en-medial_graph-en-noun-aavAMgVz",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "plane graph",
          "plane graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A graph derived from a given plane graph such that this derived graph has a vertex corresponding to each edge of the given graph, and such that for every “angle” (consecutive trio of edge, vertex, edge) along the border of a face of the given graph there is a corresponding edge which connects the vertices corresponding to the two edges that are part of that “angle”."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "medial graph"
      ]
    }
  ],
  "word": "medial graph"
}

{
  "forms": [
    {
      "form": "medial graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "medial graph (plural medial graphs)",
      "name": "en-noun"
    }
  ],
  "hypernyms": [
    {
      "word": "plane graph"
    },
    {
      "word": "regular 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",
        "English terms with usage examples",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "examples": [
        {
          "text": "The number of vertices of a medial graph is equal to the number of edges of its original graph, and the number of edges of a medial graph is equal to the sum of the degrees of the vertices of the original graph.",
          "type": "example"
        }
      ],
      "glosses": [
        "A graph derived from a given plane graph such that this derived graph has a vertex corresponding to each edge of the given graph, and such that for every “angle” (consecutive trio of edge, vertex, edge) along the border of a face of the given graph there is a corresponding edge which connects the vertices corresponding to the two edges that are part of that “angle”."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "plane graph",
          "plane graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A graph derived from a given plane graph such that this derived graph has a vertex corresponding to each edge of the given graph, and such that for every “angle” (consecutive trio of edge, vertex, edge) along the border of a face of the given graph there is a corresponding edge which connects the vertices corresponding to the two edges that are part of that “angle”."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "medial graph"
      ]
    }
  ],
  "word": "medial graph"
}