"rectagraph" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "rectangle",
        "3": "graph"
      },
      "expansion": "Blend of rectangle + graph",
      "name": "blend"
    }
  ],
  "etymology_text": "Blend of rectangle + graph",
  "forms": [
    {
      "form": "rectagraphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "rectagraph (plural rectagraphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English blends",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "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": [
        {
          "ref": "2015, Joanna B. Fawcett, “Locally triangular graphs and normal quotients of the n-cube”, in arXiv",
          "text": "Such graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every 2-path lies in a unique quadrangle.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A triangle-free connected graph where any two vertices have 0 or 2 common neighbors."
      ],
      "id": "en-rectagraph-en-noun-Le0OVJGq",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "triangle-free",
          "triangle-free#English"
        ],
        [
          "connected graph",
          "connected graph#English"
        ],
        [
          "vertices",
          "vertex#English"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A triangle-free connected graph where any two vertices have 0 or 2 common neighbors."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "rectagraph"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "rectangle",
        "3": "graph"
      },
      "expansion": "Blend of rectangle + graph",
      "name": "blend"
    }
  ],
  "etymology_text": "Blend of rectangle + graph",
  "forms": [
    {
      "form": "rectagraphs",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "rectagraph (plural rectagraphs)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English blends",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms with quotations",
        "en:Graph theory"
      ],
      "examples": [
        {
          "ref": "2015, Joanna B. Fawcett, “Locally triangular graphs and normal quotients of the n-cube”, in arXiv",
          "text": "Such graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every 2-path lies in a unique quadrangle.",
          "type": "quotation"
        }
      ],
      "glosses": [
        "A triangle-free connected graph where any two vertices have 0 or 2 common neighbors."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "triangle-free",
          "triangle-free#English"
        ],
        [
          "connected graph",
          "connected graph#English"
        ],
        [
          "vertices",
          "vertex#English"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A triangle-free connected graph where any two vertices have 0 or 2 common neighbors."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "rectagraph"
}