On optimizing restricted edge connectivity of graphs

MaRDI QIDQ2917762zbMATH OpenFDO

Authors Jingyu Wang, Jianping Ou

Publication date 1 October 2012

Published in Journal of Computational Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

distance maximal pairrestricted edge connectivity

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Recommendations

• Sufficient conditions for restricted-edge-connectivity to be optimal
• On a kind of restricted edge connectivity of graphs
• On restricted edge-connectivity of graphs.
• On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
• On the complexity of computing the \(k\)-restricted edge-connectivity of a graph
• Exploring the constrained maximum edge-weight connected graph problem
• The restricted edge-connectivity and ^-optimality of hypergraphs
• Minimally restricted edge connected graphs
• Optimal graphs with prescribed connectivities
• On optimizing m-restricted edge connectivity of generalized permutation graphs.

Cited in

(8)

• On equality of restricted edge connectivity and minimum edge degree of graphs.
• Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
• A Fast Algorithm for Optimally Increasing the Edge Connectivity
• scientific article; zbMATH DE number 2077809 (Why is no real title available?)
• Sufficient conditions for maximally restricted edge connected graphs
• Improved Budgeted Connected Domination and Budgeted Edge-Vertex Domination
• Essential Constraints of Edge-Constrained Proximity Graphs
• On restricted edge-connectivity of graphs.

This page was built for publication: On optimizing restricted edge connectivity of graphs

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