Discrete mathematics
Graphs
Complete, bipartite and planar graphs and vertex degrees.
Discrete mathematics
Complete graph edges
m = n(n−1)/2→Discrete mathematicsComplete bipartite graph edges
m = pq→Discrete mathematicsGraph degree sum
Σdeg(v) = 2m→Discrete mathematicsMaximum planar graph edges
m ≤ 3n−6→Discrete mathematicsCycle graph edges
m = n→Discrete mathematicsAverage vertex degree
d̄ = 2m/n→Discrete mathematicsUndirected graph analysis
Undirected graph analysis: calculated from the entered values→