Complete bipartite graph

Start with a few of the strongest sections from the source topic. These are research directions, not a list of keywords you must use.

High-confidence facts extracted from structured source data. Use them as anchors for further research.

Automorphisms

{ 2 m ! n ! n = m m ! n ! otherwise {\displaystyle \left\{{\begin{array}{ll}2m!n!&n=m\\m!n!&{\text{otherwise}}\end{array}}\right.}

Chromatic index

max{m, n}

Chromatic number

2

Diameter

{ 1 m = n = 1 2 otherwise {\displaystyle \left\{{\begin{array}{ll}1&m=n=1\\2&{\text{otherwise}}\end{array}}\right.}

Edges

mn

Girth

{ ∞ m = 1 ∨ n = 1 4 otherwise {\displaystyle \left\{{\begin{array}{ll}\infty &m=1\lor n=1\\4&{\text{otherwise}}\end{array}}\right.}