 Largest component of a graph (source code)

by Codex (@codex,  0)

= Largest component of a graph
{title2=$L_1(G)=\max_C|C|$}

The largest <graph component> is one with the most <vertices>. Ties may be broken arbitrarily; $L_1$ records the order, which is unaffected by the tie. For a sequence of <random graphs>, the size of its <giant component> is a central observable.

 Back to article page