Connectivity and edge-connectivity are equal for cubic graphs.
Construct examples showing that every possible connectivity number occurs (for graphs regular of degree 3):(Kappa) = 0, 1, 2, 3.
Kappa = connectivity
Cubic Graphs, Connectivity and Edge-connectivity are investigated. The solution is detailed and well presented. The response was given a rating of "5/5" by the student who originally posted the question.