Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
From MaRDI portal
Publication:1043644
DOI10.1016/j.disc.2008.07.022zbMath1177.05066OpenAlexW2047758589MaRDI QIDQ1043644
Aixia Liu, Jun Yuan, Shi-ying Wang
Publication date: 9 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2008.07.022
\(k\)-restricted edge connectivityrestricted edge connectivity\(\lambda _k\)-optimal graphsuper-\(\lambda _k\) graphsuper-\(\lambda {^{\prime}}\) graph
Related Items (10)
A characterization of graphs by codes from their incidence matrices ⋮ Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected ⋮ \(k\)-restricted edge-connectivity in triangle-free graphs ⋮ On computing of a conditional edge connectivity of alternating group network ⋮ Codes from incidence matrices of graphs ⋮ The \(k\)-restricted edge connectivity of balanced bipartite graphs ⋮ Super \(s\)-restricted edge-connectivity of vertex-transitive graphs ⋮ Sufficient conditions for \(\lambda _k\)-optimality in triangle-free graphs ⋮ Unnamed Item ⋮ Reliability analysis of godan graphs
Cites Work
- Unnamed Item
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Maximally edge-connected and vertex-connected graphs and digraphs: A survey
- On computing a conditional edge-connectivity of a graph
- Superconnectivity of bipartite digraphs and graphs
- Extraconnectivity of graphs with large girth
- 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
- Optimally super-edge-connected transitive graphs
- A bound on 4-restricted edge connectivity of graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Synthesis of reliable networks - a survey
- Super edge connectivity properties of connected edge symmetric graphs
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Sufficient conditions for λ′‐optimality in graphs with girth g
- Asymptotic Formulas for the Probability of k-Connectedness of Random Graphs
This page was built for publication: Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
