Abstract
Let $$G = (V,E)$$ G = ( V , E ) be a connected graph. The conditional edge connectivity $$\lambda _\delta ^k(G)$$ ? ? k ( G ) is the cardinality of the minimum edge cuts, if any, whose deletion disconnects $$G$$ G and each component of $$G - F$$ G - F has $$\delta \ge k$$ ? ? k . We assume that $$F \subseteq E$$ F ⊆ E is an edge set, $$F$$ F is called edge extra-cut, if $$G - F$$ G - F is not connected and each component of $$G - F$$ G - F has more than $$k$$ k vertices. The edge extraconnectivity $$\lambda _\mathrm{e}^k(G)$$ ? e k ( G ) is the cardinality of the minimum edge extra-cuts. In this paper, we study the conditional edge connectivity and edge extraconnectivity of hypercubes and folded hypercubes.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.