KEdgeConnectedGraphQ

KEdgeConnectedGraphQ[g,k] yields True if the graph g is k-edge-connected and False otherwise.

Please visit the official Wolfram Language Reference for more details and examples on core symbols.