Vulnerability of super extra edge-connected graphs

DOI10.1016/J.JCSS.2019.07.002zbMATH Open1436.68225OpenAlexW2965011693MaRDI QIDQ2009643FDOQ2009643

Sun-Yuan Hsieh, Ralf Klasing, Chia-Wen Cheng

Publication date: 29 November 2019

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2019.07.002

Recommendations

• Bounds for the super extra edge connectivity of graphs
• Vulnerability of super edge-connected networks
• Edge fault tolerance of super edge connectivity for three families of interconnection networks
• Edge fault tolerance of graphs with respect to super edge connectivity
• Extraconnectivity of \(k\)-ary \(n\)-cube networks

zbMATH Keywords

fault toleranceedge-connectivityextra edge-connectivitypersistence of networkssuper extra edge-connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Extraconnectivity of graphs with large girth
• The \(k\)-restricted edge-connectivity of a product of graphs
• Connectivity of vertex and edge transitive graphs
• On the extraconnectivity of graphs
• Conditional connectivity
• Edge fault tolerance of graphs with respect to super edge connectivity
• Title not available (Why is that?)
• Extraconnectivity of \(k\)-ary \(n\)-cube networks
• Title not available (Why is that?)
• Maximally edge-connected and vertex-connected graphs and digraphs: A survey
• Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
• On computing a conditional edge-connectivity of a graph
• \(\{2,3\}\)-extraconnectivities of hypercube-like networks
• Optimally super-edge-connected transitive graphs
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• On a kind of restricted edge connectivity of graphs
• Edge-cuts leaving components of order at least three
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Edge cuts leaving components of order at least \(m\)
• On conditional edge-connectivity of graphs
• On super edge-connectivity of product graphs
• Vulnerability of super edge-connected networks
• Edge fault tolerance of super edge connectivity for three families of interconnection networks
• On cyclic edge-connectivity of transitive graphs
• Title not available (Why is that?)
• Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
• Super Line-Connectivity Properties of Circulant Graphs
• Large graphs with given degree and diameter. II
• Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
• On restricted edge-connectivity of lexicographic product graphs

Cited In (4)

• Edge vulnerability parameters of split graphs
• Reliability measure of multiprocessor system based on enhanced hypercubes
• Fault diagnosability of bicube networks under the PMC diagnostic model
• Edge fault-tolerance analysis of maximally edge-connected graphs and super edge-connected graphs

This page was built for publication: Vulnerability of super extra edge-connected graphs

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