An interconnection network can be modelled as a connected graph [Formula: see text]. The reliability of interconnection networks is critical for multiprocessor systems. Several conditional edge-connectivities have been introduced in the past for accurately reflecting various realistic network situations, with the [Formula: see text]-extra edge-connectivity being one such conditional edge-connectivity. The [Formula: see text]-extra edge-connectivity of [Formula: see text], denoted by [Formula: see text], is the minimum cardinality of faulty edges whose deletion disconnects the graph [Formula: see text] with each resulting component containing at least [Formula: see text] processors. In general, for a connected graph [Formula: see text], determining whether the graph exists an [Formula: see text]-extra edge-cut is [Formula: see text]-hard. The folded-crossed hypercube [Formula: see text] is a variation of the crossed hypercube [Formula: see text] with [Formula: see text] processors. In this paper, after excavating the layer structure of folded-crossed hypercube, we investigate some recursive properties of [Formula: see text], based on some recursive properties, an effective [Formula: see text] algorithm of [Formula: see text]-extra edge-connectivity of folded-crossed hypercube is designed, which can determine the exact value and the [Formula: see text]-optimality of [Formula: see text] for each positive integer [Formula: see text]. Our results solve this problem thoroughly.
It is common knowledge that edge disjoint paths have close relationship with the edge connectivity. Motivated by the well-known Menger theorem, we find that the maximum cardinality of edge disjoint paths connecting any two disjoint connected subgraphs with g vertices in G can also define by the minimum modified edge-cut, called the g-extra edge-connectivity of G (λ g (G)). It is the cardinality of the minimum set of edges in G, if such a set exists, whose deletion disconnects G and leaves every remaining component with at least g vertices. The n-dimensional augmented cube AQ n is a variant of hypercube Q n . In this paper, we observe that the g-extra edge-connectivity of the augmented cube for some exponentially large enough g exists a concentration behavior, for about 72.22 percent values of g ≤ 2 n−1 , and that the g-extra edge-connectivity of AQ n (n ≥ 3) concentrates on n 2 − 1 special values. Specifically, we prove that the exact value of g-extra edge-connectivity of augmented cube is a constant 2( n 2 − r)2+r , where n ≥ 3, r = 1, 2, . . . , n 2 − 1 and l r = 2 2r+1 −2 3 if n is odd and l r = 2 2r+2 −4 3 if n is even. The above upper and lower bounds of g are sharp. Moreover, we also obtain the exponential edge disjoint paths in AQ n with edge faults.INDEX TERMS Fault tolerance, many-to-many edge disjoint paths, interconnected networks, exponential fault edges.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.