Connectivity measures in matched sum graphs (Q952660): Difference between revisions

A matched sum graph \(G\) of two disjoint graphs \(G_1\) and \(G_2\) of the same order is obtained from the union of \(G_1\) and \(G_2\) and from joining each vertex of \(G_1\) with exactly one vertex of \(G_2\) by an edge such that these edges form a matching. The authors present different lower bounds for the connectivity, edge-connectivity, restricted connectivity and restricted edge-connectivity of matched sum graphs. In addition, they give sufficient conditions which guarantee maximum values in some cases. Further results on the restricted edge-connectivity of matched sum graphs can be found in a 2003 article by \textit{N. Ueffing} and \textit{L. Volkmann}, ''Restricted edge-connectivity and minimum degree,'' [Ars Comb. 66 , 193--203 (2003; Zbl 1078.05053)].