Abstract
A restricted edge cut of a graph X is an edge set whose removal disconnects X into non-trivial components. The cardinality of the minimum restricted edge cut is the restricted edge connectivity, denoted by λ ′ ( X ) . If X has restricted edge cuts and λ ′ ( X ) achieves the upper bound of the restricted edge connectivity, X is said to be λ ′ -optimal. In this work, we will prove that for all but a few exceptions, the mixed Cayley graph is λ ′ -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.
