Abstract
Since the underlying topology of interconnection networks are often modeled as graphs or digraphs, the connectivity and the edge(arc)-connectivity of a digraph are used to measure the reliability of networks. Restricted arc-connectivity is a more refined network reliability index than arc-connectivity.In 2007, Lutz Volkmann [L. Volkmann, Restricted arc-connectivity of digraphs, Inform. Process. Lett. 103 (2007) 234–239] introduced the concept of restricted arc-connectivity to digraphs. In 2008, Shiying Wang and Shangwei Lin [S.Y. Wang, S.W. Lin, λ′-Optimal digraphs, Inform. Process. Lett. 108 (2007) 386–389] introduced the concept of minimum arc-degree and λ′-optimality of digraphs. We call a strongly connected digraph a λ′-optimal digraph if its restricted arc-connectivity is equal to its minimum arc-degree.In this paper, we study the restricted arc-connectivity of bipartite digraphs and give some sufficient conditions for a bipartite digraph to be λ′-optimal.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
