Vulnerability of super extra edge-connected graphs
type: Item
instance of: scholarly article
title: Vulnerability of super extra edge-connected graphs
zbMATH Open document ID: 1436.68225
author: Chia-Wen Cheng
author: Sun-Yuan Hsieh
author: Ralf Klasing
published in: Journal of Computer and System Sciences
publication date: 2019-11-29T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 68M15
zbMATH DE Number: 7138701
zbMATH Keywords: edge-connectivity
zbMATH Keywords: extra edge-connectivity
zbMATH Keywords: fault tolerance
zbMATH Keywords: persistence of networks
zbMATH Keywords: super extra edge-connectivity
MaRDI profile type: Publication
full work available at URL: j.jcss.2019.07.002
OpenAlex ID: W2965011693
cites work: The \(k\)-restricted edge-connectivity of a product of graphs
cites work: Large graphs with given degree and diameter. II
cites work: Super Line-Connectivity Properties of Circulant Graphs
cites work: Edge-cuts leaving components of order at least three
cites work: \(\{2,3\}\)-extraconnectivities of hypercube-like networks
cites work: Q5460881
cites work: On computing a conditional edge-connectivity of a graph
cites work: Extraconnectivity of graphs with large girth
cites work: On the extraconnectivity of graphs
cites work: Conditional connectivity
cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey
cites work: Edge fault tolerance of graphs with respect to super edge connectivity
cites work: Vertex fault tolerance of optimal-\(\kappa \) graphs and super-\(\kappa \) graphs
cites work: Vulnerability of super edge-connected networks
cites work: Extraconnectivity of \(k\)-ary \(n\)-cube networks
cites work: On super edge-connectivity of product graphs
cites work: Connectivity of vertex and edge transitive graphs
cites work: Optimally super-edge-connected transitive graphs
cites work: On a kind of restricted edge connectivity of graphs
cites work: Q4393242
cites work: Edge cuts leaving components of order at least \(m\)
cites work: Sufficient conditions for graphs to be λ′‐optimal and super‐λ′
cites work: Degree conditions for graphs to be \(\lambda_3\)-optimal and super-\(\lambda _3\)
cites work: Edge fault tolerance of super edge connectivity for three families of interconnection networks
cites work: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
cites work: On cyclic edge-connectivity of transitive graphs
cites work: Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
cites work: On conditional edge-connectivity of graphs
cites work: Q4820526
cites work: A proof of an inequality concerning \(k\)-restricted edge connectivity
cites work: On restricted edge-connectivity of lexicographic product graphs
DOI: 10.1016/J.JCSS.2019.07.002
description: scientific article; zbMATH DE number 7138701