Optimally restricted edge connected elementary Harary graphs

DOI10.1016/j.tcs.2011.12.015zbMath1420.05091OpenAlexW1978242975MaRDI QIDQ391230

Zhao Zhang, Qinghai Liu, Xiao-hui Huang

Publication date: 10 January 2014

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.12.015

zbMATH Keywords

elementary Harary graphoptimally restricted edge connectedrestricted edge connectivity

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (2)

A sufficient condition for graphs to be super \(k\)-restricted edge connected ⋮ Sufficient conditions for \(k\)-restricted edge connected graphs

Cites Work

• Unnamed Item
• 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
• 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
• Extraconnectivity of graphs with large minimum degree and girth
• On the construction of most reliable networks
• 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 proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• The structure of max ?-minm?+1 graphs used in the design of reliable networks
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• On restricted edge-connectivity of graphs.

This page was built for publication: Optimally restricted edge connected elementary Harary graphs