Vulnerability of super extra edge-connected graphs

DOI10.1016/J.JCSS.2019.07.002MaRDI QIDQ2009643zbMATH OpenOpenAlexFDO

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

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

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)

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

Cites work

• scientific article; zbMATH DE number 1161250 (Why is no real title available?)
• scientific article; zbMATH DE number 2108131 (Why is no real title available?)
• scientific article; zbMATH DE number 2187684 (Why is no real title available?)
• A proof of an inequality concerning \(k\)-restricted edge connectivity
• Conditional connectivity
• Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
• Connectivity of vertex and edge transitive graphs
• Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
• Edge cuts leaving components of order at least \(m\)
• Edge fault tolerance of graphs with respect to super edge connectivity
• Edge fault tolerance of super edge connectivity for three families of interconnection networks
• Edge-cuts leaving components of order at least three
• Extraconnectivity of k-ary n-cube networks
• Extraconnectivity of graphs with large girth
• Large graphs with given degree and diameter. II
• 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 conditional edge-connectivity of graphs
• On cyclic edge-connectivity of transitive graphs
• On restricted edge-connectivity of lexicographic product graphs
• On super edge-connectivity of product graphs
• On the extraconnectivity of graphs
• Optimally super-edge-connected transitive graphs
• Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
• Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
• Super Line-Connectivity Properties of Circulant Graphs
• The \(k\)-restricted edge-connectivity of a product of graphs
• Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
• Vulnerability of super edge-connected networks
• \(\{2,3\}\)-extraconnectivities of hypercube-like networks

Cited in

(7)

• Vulnerability of super edge-connected networks
• On neighbor component order edge connectivity
• Edge vulnerability parameters of split graphs
• Reliability measure of multiprocessor system based on enhanced hypercubes
• Bounds for the super extra edge connectivity of graphs
• 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)