Connectivity measures in matched sum graphs

DOI10.1016/J.DISC.2007.04.051MaRDI QIDQ952660zbMATH OpenOpenAlexFDO

Authors C. Balbuena, Xavier Marcote, P. García-Vázquez

Publication date 12 November 2008

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.04.051

zbMATH Keywords

ConnectivityEdge-connectivitymatched sum graphRestricted connectivityRestricted edge-connectivitySuperconnectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

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)].

Recommendations

• scientific article; zbMATH DE number 5519216
• The matching energy of graphs with given edge connectivity
• On restricted connectivities of permutation graphs
• The connectivity of maximum matching graphs
• scientific article; zbMATH DE number 4110724

Cites work

• Circulants and their connectivities
• Conditional connectivity
• Connectivity of generalized prisms over G
• Distance and connectivity measures in permutation graphs
• Every cubic cage is quasi 4-connected
• Extraconnectivity of graphs with large minimum degree and girth
• scientific article; zbMATH DE number 4162905 (Why is no real title available?)
• scientific article; zbMATH DE number 4110724 (Why is no real title available?)
• scientific article; zbMATH DE number 1055145 (Why is no real title available?)
• scientific article; zbMATH DE number 3259770 (Why is no real title available?)
• Large survivable nets and the generalized prisms
• On computing a conditional edge-connectivity of a graph
• On generalized Petersen graphs labeled with a condition at distance two
• On restricted connectivities of permutation graphs
• On restricted connectivity and extra connectivity of hypercubes and folded hypercubes
• On the extraconnectivity of graphs
• On the restricted connectivity and superconnectivity in graphs with given girth
• Sufficient conditions for λ′‐optimality in graphs with girth g
• Synthesis of reliable networks - a survey

Cited in

(4)

• Product throttling
• Sum-connectivity index of a graph
• A new approach to finding the extra connectivity of graphs
• The Component (Edge) Connectivity of Round Matching Composition Networks

This page was built for publication: Connectivity measures in matched sum graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q952660)