Optimally restricted edge connected elementary Harary graphs

DOI10.1016/J.TCS.2011.12.015MaRDI QIDQ391230zbMATH OpenOpenAlexFDO

Authors Qinghai Liu, Zhao Zhang, Xiaohui 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)

Recommendations

• Restricted edge connectivity of Harary graphs
• Sufficient conditions for k-restricted edge connected graphs
• Sufficient conditions for restricted-edge-connectivity to be optimal
• Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected
• Local restricted edge connectivity and restricted edge connectivity of graphs.

Cites work

• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
• Edge cuts leaving components of order at least \(m\)
• Edge-cuts leaving components of order at least three
• Extraconnectivity of graphs with large girth
• Extraconnectivity of graphs with large minimum degree and girth
• Graph theory with applications
• scientific article; zbMATH DE number 1332751 (Why is no real title available?)
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• On a kind of restricted edge connectivity of graphs
• On computing a conditional edge-connectivity of a graph
• On restricted edge-connectivity of graphs.
• On the construction of most reliable networks
• Optimally super-edge-connected transitive graphs
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• The structure of max ?-minm?+1 graphs used in the design of reliable networks

Cited in

(5)

• A sufficient condition for graphs to be super \(k\)-restricted edge connected
• Sufficient conditions for k-restricted edge connected graphs
• Restricted vertex connectivity of Harary graphs.
• Restricted edge connectivity of Harary graphs
• Evaluating the reliability of complete Josephus cubes under extra link fault with the optimal solution of the edge isoperimetric problem

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

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