A sufficient condition for graphs to be super k-restricted edge connected

DOI10.7151/DMGT.1939MaRDI QIDQ2364076zbMATH OpenOpenAlexFDO

Authors Meiyu Wang, Lei Zhang, Shiying Wang

Publication date 17 July 2017

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.1939

zbMATH Keywords

neighborhood\(k\)-restricted edge connectivitysuper \(k\)-restricted edge connected graph

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
• Edge fault tolerance analysis of super \(k\)-restricted connected networks
• Super restricted edge connectivity of regular graphs
• Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected

Cites work

• A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Extraconnectivity of graphs with large girth
• Graph theory
• Neighborhood conditions for graphs to be super restricted edge connected
• On 3-Extra Connectivity and 3-Extra Edge Connectivity of Folded Hypercubes
• On a kind of restricted edge connectivity of graphs
• On computing a conditional edge-connectivity of a graph
• Optimally restricted edge connected elementary Harary graphs
• Optimally super-edge-connected transitive graphs
• Reliability analysis of bijective connection networks in terms of the extra edge-connectivity
• Sufficient conditions for \(k\)-restricted edge connected graphs
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Sufficient conditions for λ′‐optimality in graphs with girth g
• Super restricted edge-connectivity of graphs with diameter 2

Cited in

(15)

• Reliability analysis of godan graphs
• Neighborhood conditions for graphs to be super restricted edge connected
• The edge connectivity of expanded \(k\)-ary \(n\)-cubes
• Super restricted edge connectivity of regular graphs
• Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected
• scientific article; zbMATH DE number 2114675 (Why is no real title available?)
• Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Sufficient conditions for graphs to be maximally 4-restricted edge connected
• Sufficient conditions for bipartite graphs to be super-\(k\)-restricted edge connected
• Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected
• The \(p\)-restricted edge-connectivity of Kneser graphs
• On super connectedness and super restricted edge-connectedness of total graphs.
• Sufficient conditions for \(k\)-restricted edge connected graphs
• Sufficient conditions for bipartite graphs to be super restricted edge-connected

This page was built for publication: A sufficient condition for graphs to be super \(k\)-restricted edge connected

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