Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property

DOI10.1016/j.tcs.2019.03.024zbMath1428.05175OpenAlexW2924148216MaRDI QIDQ2317864

Yaoyao Zhang, Shuang Zhao, Ji Xiang Meng

Publication date: 13 August 2019

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

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

zbMATH Keywords

networksfault tolerancerestricted edge connectivity\(\lambda_h\)-optimal

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (1)

About uniqueness of the minimal 1-edge extension of hypercube Q4

Cites Work

• Unnamed Item
• Unnamed Item
• Vulnerability of super edge-connected networks
• Edge fault tolerance of graphs with respect to super edge connectivity
• Edge fault tolerance of super edge connectivity for three families of interconnection networks
• K-restricted edge connectivity for some interconnection networks
• On computing a conditional edge-connectivity of a graph
• Super-connectivity and super-edge-connectivity for some interconnection networks
• Edge-cuts leaving components of order at least three
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• On the extraconnectivity of graphs
• Fault tolerant routing in the star and pancake interconnection networks
• Restricted connectivity for three families of interconnection networks
• Linearly many faults in Cayley graphs generated by transposition trees
• Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
• On restricted edge-connectivity of graphs.

This page was built for publication: Edge fault tolerance of graphs with respect to \(\lambda_{2}\)-optimal property