Connectivity measures in matched sum graphs
type: Item
instance of: scholarly article
title: Connectivity measures in matched sum graphs
zbMATH Open document ID: 1155.05036
author: C. Balbuena
author: Xavier Marcote
author: P. García-Vázquez
published in: Discrete Mathematics
publication date: 2008-11-12T00:00:00Z
review text: 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)].
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5365259
zbMATH Keywords: Connectivity
zbMATH Keywords: Edge-connectivity
zbMATH Keywords: Restricted connectivity
zbMATH Keywords: Restricted edge-connectivity
zbMATH Keywords: Superconnectivity
zbMATH Keywords: matched sum graph
reviewed by: Lutz Volkmann
MaRDI profile type: Publication
full work available at URL: j.disc.2007.04.051
OpenAlex ID: W1975812829
cites work: Extraconnectivity of graphs with large minimum degree and girth
cites work: On the restricted connectivity and superconnectivity in graphs with given girth
cites work: Sufficient conditions for λ′‐optimality in graphs with girth g
cites work: On restricted connectivities of permutation graphs
cites work: Synthesis of reliable networks - a survey
cites work: Circulants and their connectivities
cites work: Q5545841
cites work: Q4350166
cites work: On computing a conditional edge-connectivity of a graph
cites work: On the extraconnectivity of graphs
cites work: Q3490015
cites work: On generalized Petersen graphs labeled with a condition at distance two
cites work: Distance and connectivity measures in permutation graphs
cites work: Conditional connectivity
cites work: Large survivable nets and the generalized prisms
cites work: Every cubic cage is quasi 4-connected
cites work: Q3834076
cites work: Connectivity of generalized prisms over G
cites work: On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
DOI: 10.1016/J.DISC.2007.04.051
description: scientific article; zbMATH DE number 5365259