k-Edge-Connected Graph

Author

Eric W. Weisstein
June 2, 2004

This notebook downloaded from http://mathworld.wolfram.com/notebooks/GraphTheory/KEdge-ConnectedGraph.nb.

For more information, see Eric's MathWorld entry http://mathworld.wolfram.com/k-Edge-ConnectedGraph.html.

©2005 Wolfram Research, Inc. except for portions noted otherwise

Enumeration

Note: 2-connected graphs seem to be different from biconnected graphs!!!

EdgeConnectivity/@Graphs[4]

Timing[cne=Table[EdgeConnectivity/@Graphs[n],{n,7}]][[1]]

Table[Count[cne[[n]],k],{k,0,7},{n,7}]//ColumnForm