# Glossary¶

- adjacency¶
Square matrix whose entries indicate edges between nodes of a graph, usually denoted by \(A\).

- biadjacency¶
Rectangular matrix whose entries indicate edges between nodes of a bipartite graph, usually denoted by \(B\).

- co-neighbors¶
Graph defined by \(\tilde{A} = AF^{-1}A^T\), or \(\tilde{B} = BF^{-1}B^T\), where \(F\) is a weight matrix.

- degree¶
For an unweighted, undirected graph, the degree of a node is defined as its number of neighbors.

- embedding¶
Mapping of the nodes of a graph to points in a vector space.

- graph¶
Mathematical object \(G = (V, E)\), where \(V\) is the set of vertices or nodes and \(E \in V \times V\) the set of edges.