"dual graph" meaning in English

{
  "forms": [
    {
      "form": "dual graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "dual graph (plural dual 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 edges of a dual graph are perpendicular, in some sense, to the edges of its original graph. The dual graph also has as many vertices and faces as its original graph has faces and vertices, respectively. Therefore the dual graph has the same Euler characteristic as its original graph.",
          "type": "example"
        }
      ],
      "glosses": [
        "A graph derived from some plane graph in such a way that the derived graph has a vertex corresponding to each face of the given graph, an edge corresponding to each edge of the given graph that is shared by a pair of distinct faces, and a self-loop for each edge of the given graph that is a border of the same face on both of its sides."
      ],
      "id": "en-dual_graph-en-noun-vLgUzivu",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "plane graph",
          "plane graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A graph derived from some plane graph in such a way that the derived graph has a vertex corresponding to each face of the given graph, an edge corresponding to each edge of the given graph that is shared by a pair of distinct faces, and a self-loop for each edge of the given graph that is a border of the same face on both of its sides."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "dual graph"
      ]
    }
  ],
  "word": "dual graph"
}

{
  "forms": [
    {
      "form": "dual graphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "dual graph (plural dual graphs)",
      "name": "en-noun"
    }
  ],
  "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 edges of a dual graph are perpendicular, in some sense, to the edges of its original graph. The dual graph also has as many vertices and faces as its original graph has faces and vertices, respectively. Therefore the dual graph has the same Euler characteristic as its original graph.",
          "type": "example"
        }
      ],
      "glosses": [
        "A graph derived from some plane graph in such a way that the derived graph has a vertex corresponding to each face of the given graph, an edge corresponding to each edge of the given graph that is shared by a pair of distinct faces, and a self-loop for each edge of the given graph that is a border of the same face on both of its sides."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "plane graph",
          "plane graph"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A graph derived from some plane graph in such a way that the derived graph has a vertex corresponding to each face of the given graph, an edge corresponding to each edge of the given graph that is shared by a pair of distinct faces, and a self-loop for each edge of the given graph that is a border of the same face on both of its sides."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "dual graph"
      ]
    }
  ],
  "word": "dual graph"
}