On 3-restricted edge connectivity of undirected binary Kautz graphs (Q1011693)

For a connected graph an \(m\)-restricted edge cut is an edge cut that disconnects this graph without any component having order less that \(m\). The size of a minimum \(m\)-restricted edge cut of graph \(G\) is called \(m\)-restricted edge connectivity of \(G\). The main results of this paper are the following: the undirected binary Kautz graph \(UK(2,n)\) is maximal 2-restricted edge connected when \(n\geq 3\) and every minimum 2-restricted edge cut disconnects this graph into two components, one of which being an isolated edge and it is maximal 3-restricted edge connected also when \(n\geq 3\).