\(\lambda ^{\prime}\)-optimal digraphs
type: Item
instance of: scholarly article
title: \(\lambda ^{\prime}\)-optimal digraphs
zbMATH Open document ID: 1191.68093
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5719219
zbMATH Keywords: fault tolerance
zbMATH Keywords: restricted edge-connectivity
zbMATH Keywords: restricted arc-connectivity
author: Shiying Wang
author: Shangwei Lin
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.07.008
OpenAlex ID: W88080339
cites work: Sufficient conditions for \(\lambda ^{\prime}\)-optimality of graphs with small conditional diameter
cites work: Sufficient conditions for λ′‐optimality in graphs with girth g
cites work: Complexity of network reliability computations
cites work: Combinatorial optimization problems in the analysis and design of probabilistic networks
cites work: On computing a conditional edge-connectivity of a graph
cites work: Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
cites work: Maximally edge-connected and vertex-connected graphs and digraphs: A survey
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: Q5466060
cites work: Restricted arc-connectivity of digraphs
cites work: Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
cites work: On restricted edge-connectivity of graphs.
DOI: 10.1016/J.IPL.2008.07.008
description: scientific article; zbMATH DE number 5719219