Computer science
Graphs and data structures
Edges, degrees, graph density and tree properties.
Computer science
Maximum undirected graph edges
mmax = n(n−1)/2→Computer scienceMaximum directed graph edges
mmax = n(n−1)→Computer scienceNumber of tree edges
m = n − 1→Computer scienceUndirected graph density
D = 2m/[n(n−1)]→Computer scienceAverage graph degree
davg = 2m/n→Computer scienceAdjacency matrix size
C = n²→Computer scienceFull binary tree nodes
N = 2^(h+1) − 1→Computer scienceFull binary tree leaves
L = 2ʰ→Computer scienceFull binary tree internal nodes
I = L − 1→