component edge connectivityFault tolerance is an important issue in interconnection networks, and the traditional edge connectivity is an important measure to evaluate the robustness of an interconnection networ
Augmented cubes, proposed by Choudum and Sunitha [12], are derivatives of the hypercubes with good geometric features that retain some favorable properties of the hypercubes, such as vertex symmetry, maximum connectivity, best possible wide diameter, routing, and broadcasting procedures with linear ...
So, κ2 is the usual connectivity. In this paper, we determine the r-component connectivity of the hypercube Q n for r=2, 3, …, n+1, and we classify all the corresponding optimal solutions.关键词: hypercubes component connectivity ...
The k-restricted edge-connectivity of the data center network DCell Appl. Math. Comput. (2021) X. Wang et al. The restricted h-connectivity of the data center network DCell Discrete Appl. Math. (2016) S. Zhao et al. Component connectivity of hypercubes Theor. Comput. Sci. (2016) S....
Component connectivity of hypercubesHypercubesFault-toleranceComponent connectivityConditional connectivityThe r-component connectivity ck(r)(G) of a non-complete graph G is the minimum number of vertices whose deletion results in a graph with at least r components. In this paper, we determine the ...
The $g$-component edge connectivity $c\\lambda_g(G)$ of a non-complete graph $G$ is the minimum number of edges whose deletion results in a graph with at least $g$ components. In this paper, we determine the component edge connectivity of the folded hypercube $c\\lambda_{g+1}(FQ...
component connectivitycomponent edge connectivityFault tolerance is an important issue in interconnection networks, and the traditional edge connectivity is an important measure to evaluate the robustness of an interconnection network. The compon...
hypercubescomponent connectivityThe r-component connectivity κr(G) of the non-complete graph G is the minimum number of vertices whose deletion results in a graph with at least r components. So, κ2 is the usual connectivity. In this paper, we determine the r-component connectivity of the ...
HypercubesFault-toleranceComponent connectivityConditional connectivityThe _r_-component connectivity of a non-complete graph _G_ is the minimum number of vertices whose deletion results in a graph with at least _r_ components. In this paper, we determine the component connectivity of the hypercube ...
Fault-tolerability analysis of hypercubes based on 3-component path-structure connectivityInterconnection networkHypercubeInterconnection networks are essential in parallel computing and network science nowadays. Network failures are inevitable during operation and result in inestimable losses. Hence, designing an...