# All Science Fair Projects

## Science Fair Project Encyclopedia for Schools!

 Search    Browse    Forum  Coach    Links    Editor    Help    Tell-a-Friend    Encyclopedia    Dictionary

# Science Fair Project Encyclopedia

For information on any area of science that interests you,
enter a keyword (eg. scientific method, molecule, cloud, carbohydrate etc.).
Or else, you can start by choosing any of the categories below.

In mathematics and computer science, the biadjacency matrix for a finite bipartite graph G with n black vertices and m white vertices is an n × m matrix where the entry aij is the number of edges joining black vertex i and white vertex j. In the special case of a finite, undirected simple bipartite graph , the biadjacency matrix is a (0,1)-matrix.

The relationship between a bipartite graph and its biadjacency matrix is studied in spectral graph theory.

## Property

The adjacency matrix A for a bipartite graph with a biadjacency matrix B is given by

$A = \begin{pmatrix} 0 & B \\ B^T & 0 \end{pmatrix}.$
Last updated: 05-27-2005 15:29:01
03-10-2013 05:06:04