Abstract
Let G be a connected k(≥3)-regular graph with girth g. A set S of the edges in G is called an R2-edge-cut if G-S is disconnected and contains neither an isolated vertex nor a one-degree vertex. The R2-edge-connectivity of G, denoted by λn(G), is the minimum cardinality over all R2-edge-cuts, which is an important measure for fault-tolerance of computer interconnection networks. In this paper, λn(G)=g(2k−2) for any 2k-regular connected graph G(≠K5) that is either edge-transitive or vertex-transitive and g≥5 is given.
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 callMore From: Applied Mathematics-A Journal of Chinese Universities
Disclaimer: 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.
