Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
type: Item
instance of: scholarly article
title: Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
zbMATH Open document ID: 1177.05066
author: Jun Yuan
author: Aixia Liu
author: Shiying Wang
published in: Discrete Mathematics
publication date: 2009-12-09T00:00:00Z
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5644078
zbMATH Keywords: restricted edge connectivity
zbMATH Keywords: \(k\)-restricted edge connectivity
zbMATH Keywords: super-\(\lambda {^{\prime}}\) graph
zbMATH Keywords: \(\lambda _k\)-optimal graph
zbMATH Keywords: super-\(\lambda _k\) graph
MaRDI profile type: Publication
full work available at URL: j.disc.2008.07.022
OpenAlex ID: W2047758589
cites work: Superconnectivity of bipartite digraphs and graphs
cites work: Sufficient conditions for λ′‐optimality in graphs with girth g
cites work: Synthesis of reliable networks - a survey
cites work: Q3097395
cites work: Edge-cuts leaving components of order at least three
cites work: On computing a conditional edge-connectivity of a graph
cites work: Extraconnectivity of graphs with large girth
cites work: Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey
cites work: Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
cites work: Super edge connectivity properties of connected edge symmetric graphs
cites work: Optimally super-edge-connected transitive graphs
cites work: On a kind of restricted edge connectivity of graphs
cites work: Edge cuts leaving components of order at least \(m\)
cites work: A bound on 4-restricted edge connectivity of graphs
cites work: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity
cites work: Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
DOI: 10.1016/J.DISC.2008.07.022
Recommended article: Sufficient conditions for bipartite graphs to be super restricted edge-connected
Recommended article: A sufficient condition for graphs to be super \(k\)-restricted edge connected
Recommended article: Q3110551
Recommended article: Sufficient conditions for a graph to be super restricted edge-connected
Recommended article: Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
Recommended article: Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected
Recommended article: Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
Recommended article: Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
Recommended article: Neighborhood and degree conditions for super-edge-connected bipartite digraphs
Recommended article: On super-edge-connected digraphs and bipartite digraphs
description: scientific article; zbMATH DE number 5644078