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...
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 ...
So far, the values of the g-component (edge) connectivity of special networks with small g have been extensively investigated. For general graphs, the results of the g-component connectivity are very few. In this paper, we propose some lower and upper bounds for the g-component connectivity ...
Fault-tolerant strong Menger (edge) connectivity and 3-extra edge connectivity of balanced hypercubes Theor. Comput. Sci., 707 (2018), pp. 56-68 View PDFView articleGoogle Scholar [18] P.S. Li, M. Xu Edge-fault-tolerant strong Menger edge connectivity on the class of hypercube-like netwo...
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 network. The component edge connectivity is a generalization of the traditional edge connectivity. The ...
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...
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 ...
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 ...
Hypercube-like networks (HL-networks for short) are obtained by manipulating some pairs of edges in hypercubes, which contain several famous interconnection networks such as twisted cubes, Mobius cubes, crossed cubes, locally twisted cubes. In this paper, we determine the (g+1)-component edge ...
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 ...