Super-connectivity and super-edge-connectivity for some interconnection networks (Q1406242)

A \(k\)-regular graph \(G\) is super-(edge)-connected if its (edge) connectivity equals \(k\), and each vertex (edge) cut of \(G\) of cardinality \(k\) consists of all vertices adjacent to some vertex (of all edges incident with some vertex). In the paper three constructions of super-(edge)-connected graphs are provided. The constructions enable the authors to discuss the super-(edge)-connectivity of some well-known classes of graphs that are used for interconnection networks.