n-connected graph

n-connected graph

[′en kə‚nek·təd ′graf]
(mathematics)
A connected graph for which the removal of n points is required to disconnect the graph.