The maximum number of edges in a bipartite graph on 12 vertices is ________

Concept:

A complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set.

Complete bipartite graph contains maximum number of edges

Data:

Number of vertices = n = 12

Formula:

Maximum number of edges in a bipartite graph of n vertices is \(\left\lfloor {\frac{{\;{n^2}}}{4}} \right\rfloor \)

Calculation:

Maximum number of edges in a bipartite graph of n vertices

\(\frac{{\;{{12}^2}}}{4} = 36\)

Example:

n = 6

Number of edges = \(\frac{{\;{6^2}}}{4} = 9\)