This section introduces some common notation and assumptions used throughout the chapter.
A complete graph, denoted , is a graph in which every pair of nodes in N is connected by a link. The number of links in is described in Table 1.55.
Table 1.55: Formulas for Number of Links in
Graph Direction |
Default |
INCLUDE_SELFLINK |
Directed |
|
|
Undirected |
|
|