  A vertex cut $S$ of a connected graph $G$ is a subset of vertices of $G$
whose deletion makes $G$ disconnected. A super vertex cut $S$ of a connected
graph $G$ is a subset of vertices of $G$ whose deletion makes $G$ disconnected
and there is no isolated vertex in each component of $G-S$. The
super-connectivity of graph $G$ is the size of the minimum super vertex cut of
$G$. Let $KG(n,k)$ be the Kneser graph whose vertices set are the $k$-subsets
of $\{1,\cdots,n\}$, where $k$ is the number of labels of each vertex in $G$.
We aim to show that the conjecture from Boruzanli and Gauci \cite{EG19} on the
super-connectivity of Kneser graph $KG(n,k)$ is true when $k=3$.
