Connectivity of the Mycielskian of a graph (Q2427520)

For triangle-free graphs with arbitrarily large chromatic numbers, Mycielski developed a graph transformation that transforms a graph \(G\) into a new graph \(\mu(G)\). This short paper study the vertex-connectivity \(k(\mu(G))\) and edge-connectivity \(k'(\mu(G))\) of \(\mu(G)\). The authors prove that \(k(\mu(G))= \min\{\delta(\mu(G)),2k(G)+1\}\) and \(k'(\mu(G))= \delta(\mu(G))\), where \(\delta(G)\) is the minimum degree of \(G\).