Connectivity(Graph Theory).

38 Views Asked by At

Today, I studied in mathematics but I confuse something:

Say, $G$ is $k-$connected if $\kappa(G)\ge k$.

$\kappa(G)$ is the smallest $|S|$ such that $S\subset V(G)$ and $G-S$ is disconnected or a single (only one vertex).

For $\kappa(G)\ge k$, there is a graph such that $\kappa(G)> k$ ?