科研之友
微信
新浪微博
Facebook
分享链接
摘要
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 lambda'-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 lambda'-optimal.
- 出版日期2008-11-30
- 单位山西大学
