On the line graphs of the complete \(r\)-partite graphs (Q1363708)

Let \(G\) be a graph with \(n\) vertices and \(\{V_1,\dots,V_r\}\) a partition of \(V(G)\) with \(|V_i|= p_i\) \((1\leq i\leq r)\) where \(p_1\leq\cdots\leq p_r\). Here the author proves that the vertex-connectivity of the line graph of the complete \(r\)-partite graph \(G\) equals \(2n-2-p_{r-1}- p_r\), which is the minimum degree.