scientific article; zbMATH DE number 6857393
From MaRDI portal
Publication:5374231
zbMath1383.05182MaRDI QIDQ5374231
Mujiangshan Wang, Meiyu Wang, Shi-ying Wang, Yu-qing Lin
Publication date: 10 April 2018
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/70/ajc_v70_p123.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sufficient conditions for \(k\)-restricted edge connected graphs
- Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
- A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- 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 a kind of restricted edge connectivity of graphs
- The \(k\)-restricted edge-connectivity of a product of graphs
- Edge-cuts leaving components of order at least three
- On the extraconnectivity of graphs
- Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
- A sufficient condition for graphs to be super \(k\)-restricted edge connected
- 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\)
- Neighborhood conditions for graphs to be super restricted edge connected
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- 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:
