Abstract
AbstractRestricted edge connectivity is a more refined network reliability index than edge connectivity. For a connected graph G = (V, E), an edge set S ⊆ E is a restricted edge cut if G − S is disconnected and every component of G − S has at least two vertices. The restricted edge connectivity of G is defined as the cardinality of a minimum restricted edge cut. G is super restricted edge connected if every minimum restricted edge cut of G isolates one edge. In this article, we present several neighborhood conditions for a graph to be super restricted edge connected. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010
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.
