Zhang, Component connectivity of hypercubes, Theoretical Computer Science. 640 (2016) 115-118.S. Zhao, W. Yang, S. Zhang, Component con- nectivity of hypercubes, Theoretical Comput. Sci. 640, 2016, pp. 115-118.S. Zhao, W. Yang, S. Zhang, Component connectivity of hypercubes, Theor. ...
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 ...
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 along with their sharpness, and then suggest some characterization of trees and general graphs with given g-component connectivity....
Zhang, Component connectivity of hypercubes, Theoretical Computer Science. 640 (2016) 115-118.S. Zhao, W. Yang, S. Zhang, Component con- nectivity of hypercubes, Theoretical Comput. Sci. 640, 2016, pp. 115-118.S. Zhao, W. Yang, S. Zhang, Component connectivity of hypercubes, Theor. ...
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 ...
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 ...
component connectivitycomponent edge connectivityThe $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 ...
In this paper, we prove the lower bound of the g-component connectivity of any n-dimensional hypercube-like networks. We also determine the g-component connectivity of varietal hypercubes and crossed cubes which are the members of hypercube-like networks. As a by-product, we characterize 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 DiagnosabilityComponent connectivityPMC modelHypercubesFault diagnosability evaluation for interconnection networks is important to the design and maintenance of multiprocessor systems. Many parameters have been proTian, YongcuiZhu, QiangSocial Science Electronic Publishing...