The k-restricted edge connectivity of balanced bipartite graphs

DOI10.1007/S00373-010-0966-1zbMATH Open1235.05082OpenAlexW2015115337MaRDI QIDQ659684FDOQ659684

Authors: Jun Yuan, Aixia Liu 

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0966-1

Recommendations

• Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
• Sufficient conditions for bipartite graphs to be super restricted edge-connected
• Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
• Super-\(\lambda \) connectivity of bipartite graphs.
• Sufficient conditions for \(k\)-restricted edge connected graphs

zbMATH Keywords

\(k\)-restricted edge connectivityedge connectivitybalanced bipartite graphsdegree sum conditions

Mathematics Subject Classification ID

Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• On the extraconnectivity of graphs
• Graph theory with applications
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On computing a conditional edge-connectivity of a graph
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• On a kind of restricted edge connectivity of graphs
• Edge-cuts leaving components of order at least three
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
• Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
• Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs
• A bound on 4-restricted edge connectivity of graphs
• Title not available (Why is that?)
• Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)

Cited In (5)

• Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
• On the \(p\)-restricted edge connectivity of the bipartite Kneser graph \(H(n,k)\)
• The \(p\)-restricted edge-connectivity of Kneser graphs
• Super-\(\lambda \) connectivity of bipartite graphs.
• On the connectivity of bipartite distance-balanced graphs

This page was built for publication: The \(k\)-restricted edge connectivity of balanced bipartite graphs

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