Connectivity Pair

An ordered pair (a,b) of nonnegative integers such that there is some set of a points and b edges whose removal disconnects the graph and there is no set of a-1 nodes and b edges or a nodes and b-1 edges with this property.

Explore with Wolfram|Alpha


Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.

Referenced on Wolfram|Alpha

Connectivity Pair

Cite this as:

Weisstein, Eric W. "Connectivity Pair." From MathWorld--A Wolfram Web Resource.

Subject classifications