# graph.full.bipartite

From igraph v0.5.3
by Gabor Csardi

##### Create a full bipartite graph

Bipartite graphs are also called two-mode by some. This function creates a bipartite graph in which every possible edge is present.

- Keywords
- graphs

##### Usage

`graph.full.bipartite (n1, n2, directed = FALSE, mode = c("all", "out", "in"))`

##### Arguments

- n1
- The number of vertices of the first kind.
- n2
- The number of vertices of the second kind.
- directed
- Logical scalar, whether the graphs is directed.
- mode
- Scalar giving the kind of edges to create for directed
graphs. If this is
then all vertices of the first kind are connected to the others;`out`

specifies the opposite direction;`in`

##### Details

Bipartite graphs have a `type`

`FALSE`

for the vertices of the first
kind and `TRUE`

for vertices of the second kind.

##### Value

- An igraph graph, with the
vertex attribute set.`type`

##### concept

- Bipartite graph
- Two-mode network

##### See Also

`graph.full`

for creating one-mode full graphs

##### Examples

```
g <- graph.full.bipartite(2, 3)
g2 <- graph.full.bipartite(2, 3, dir=TRUE)
g3 <- graph.full.bipartite(2, 3, dir=TRUE, mode="in")
g4 <- graph.full.bipartite(2, 3, dir=TRUE, mode="all")
```

*Documentation reproduced from package igraph, version 0.5.3, License: GPL (>= 2)*

### Community examples

Looks like there are no examples yet.