Abstract
Restricted arc-connectivity is a more refined network reliability index than arc-connectivity. An arc subset [Formula: see text] of a strong digraph [Formula: see text] is a restricted arc-cut of [Formula: see text] if [Formula: see text] has a non-trivial strong component [Formula: see text] such that [Formula: see text] contains an arc. The restricted arc-connectivity is the minimum cardinality over all restricted arc-cuts of [Formula: see text]. A strong digraph is super-[Formula: see text] if its restricted arc-connectivity is maximal and the number of its minimum restricted arc-cuts is minimal. In this paper, we present some neighborhood conditions for a digraph to be super-[Formula: see text].
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
