Degree conditions for graphs to be maximally \(k\)-restricted edge connected and super \(k\)-restricted edge connected

DOI10.1016/j.dam.2014.10.027zbMath1311.05179MaRDI QIDQ2342389

Nana Zhao, Shi-ying Wang

Publication date: 28 April 2015

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2014.10.027

zbMATH Keywords

interconnection network; \(k\)-restricted edge connectivity; degree condition; \(\lambda_k\)-optimal graph; super-\(\lambda_k\) graph

Mathematics Subject Classification ID

05C82: Small world graphs, complex networks (graph-theoretic aspects)

05C40: Connectivity

Related Items

Unnamed Item, Unnamed Item, Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected, Reliability analysis of godan graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A neighborhood condition for graphs to be maximally \(k\)-restricted edge connected
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• On computing a conditional edge-connectivity of a graph
• On a kind of restricted edge connectivity of graphs
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Optimally super-edge-connected transitive graphs
• On the extraconnectivity of graphs
• A bound on 4-restricted edge connectivity of graphs
• A sufficient condition for graphs to be \(\lambda_k\)-optimal
• Upper bound on the third edge-connectivity of graphs
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Sufficient conditions for graphs to be λ′‐optimal and super‐λ′