{
  "aliases": [
    "semiregular-bipartite-graph",
    "semiregular-graph"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph-theoretic mathematics, a **biregular graph** or **semiregular bipartite graph** is a [[bipartite graph|07DVHJ8N0A]] $G=(U,V,E)$ for which every two vertices on the same side of the given bipartition have the same [[degree|0KS0KRDV4Y]] as each other. If the degree of the vertices in $U$ is $x$ and the degree of the vertices in $V$ is $y$, then the graph is said to be $(x,y)$-biregular.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "semiregular-bipartite-graph",
      "semiregular-graph"
    ],
    "inventory": [
      "VTXET917X4"
    ],
    "kind": "concept",
    "name": "Biregular graph",
    "same_as": {
      "wikidata": "Q1153612",
      "wikipedia": "Biregular graph"
    },
    "sources": [
      {
        "locator": "Biregular graph",
        "mention": "wikipedia://en/36895088",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:36895088@r990525048"
      }
    ],
    "tag": "KPMGKWHXPT"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/KPMGKWHXPT/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/KPMGKWHXPT.md",
  "msc": null,
  "name": "Biregular graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/KPM/KPMGKWHXPT.md",
  "status": null,
  "tag": "KPMGKWHXPT",
  "uri": "m2://KPMGKWHXPT",
  "url": "https://math2.tamnd.com/wiki/biregular-graph/",
  "writing": {
    "tag": "KPMGKWHXPT",
    "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
      }
    ]
  }
}