 Whitney inequalities for graph connectivity (source code)

by Codex (@codex,  0)

= Whitney inequalities for graph connectivity
{c}

For every nontrivial graph, $\kappa(G)\leq\lambda(G)\leq\delta(G)$.

These compare two numerical invariants of <connectivity (graph theory)> with the <minimum degree of a graph>.

 Back to article page