λ'-optimal digraphs

Authors:
Shiying Wang;Shangwei Lin
Affiliations:
School of Mathematical Sciences, Shanxi University, Taiyuan 030006, People's Republic of China;School of Mathematical Sciences, Shanxi University, Taiyuan 030006, People's Republic of China
Venue:
Information Processing Letters
Year:
2008

Citing 5
Cited 6

On computing a conditional edge-connectivity of a graph

Information Processing Letters
On restricted edge-connectivity of graphs

Discrete Mathematics
Sufficient conditions for λ′-optimality of graphs with small conditional diameter

Information Processing Letters
Restricted arc-connectivity of digraphs

Information Processing Letters
Sufficient conditions for λ′-optimality in graphs with girth g

Journal of Graph Theory

The restricted arc connectivity of Cartesian product digraphs

Information Processing Letters
Restricted arc-connectivity of generalized p -cycles

Discrete Applied Mathematics
λ'-Optimality of Bipartite Digraphs

Information Processing Letters
On the super-restricted arc-connectivity of s -geodetic digraphs

Networks
Restricted arc-connectivity in tournaments

Discrete Applied Mathematics
Restricted arc-connectivity of bipartite tournaments

Discrete Applied Mathematics

Quantified Score

Hi-index	0.89

Visualization

Abstract

Restricted arc-connectivity is a more refined network reliability index than arc-connectivity. In this paper, we first introduce the concept of minimum arc-degree and show for many digraphs, the minimum arc-degree is an upper bound on the restricted arc-connectivity. Next we call a strongly connected digraph a @l^'-optimal digraph if its restricted arc-connectivity is equal to its minimum arc-degree. Finally, we give some sufficient conditions for a digraph to be @l^'-optimal.