Abstract

A graph is said to be edge-superconnected if each minimum edge-cut consists of all the edges incident with some vertex of minimum degree. A graph G is said to be a $\{d,d+1\}$ **image** -semiregular graph if all its vertices have degree either d or $d+1$ **image** . A smallest $\{d,d+1\}$ **image** -semiregular graph G with girth g is said to be a $(\{d,d+1\};g)$ **image** -cage. We show that every $(\{d,d+1\};g)$ **image** -cage with odd girth g is edge-superconnected. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011 © 2011 Wiley Periodicals, Inc.

Full Text
Paper version not known

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

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.