Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
From MaRDI portal
Publication:1727755
DOI10.1016/j.dam.2018.07.027zbMath1405.05092OpenAlexW2889968425MaRDI QIDQ1727755
Publication date: 20 February 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.07.027
Cites Work
- Unnamed Item
- \(k\)-restricted edge-connectivity in triangle-free graphs
- On a kind of reliability analysis of networks
- Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
- On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\)
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- On the restricted connectivity and superconnectivity in graphs with given girth
- Edge fault tolerance analysis of super \(k\)-restricted connected networks
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- On computing a conditional edge-connectivity of a graph
- Extraconnectivity of graphs with large girth
- On the construction of most reliable networks
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Optimally super-edge-connected transitive graphs
- Super restricted edge-connectivity of graphs with diameter 2
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- On unreliability polynomials and graph connectivity in reliable network synthesis
- On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
- Sufficient conditions for λ′‐optimality in graphs with girth g
This page was built for publication: Sufficient conditions for graphs with girth \(g\) to be maximally \(k\)-restricted edge connected
