Litao Guo, "Component Connectivity of Crossed Cubes," WSEAS Transactions on Mathematics, vol. 16, pp. 290-294, 2017, DOI:
Litao Guo. Component Connectivity of Crossed Cubes.
WSEAS Transactions on Mathematics. 2017;16:290-294.
WSEAS Transactions on Mathematics
Print ISSN: 1109-2769, E-ISSN: 2224-2880
Volume 16, 2017
Component Connectivity of Crossed Cubes
Author:
Abstract: Let G = (V,E) be a connected graph. A r-component cut of G is a set of vertices whose deletion results in a graph with at least r components. r-component connectivity cκr(G) of G is the size of the smallest r-component cut. The r-component edge connectivity cλr(G) can be defined similarly. In this paper, we determine the r-component (edge) connectivity of crossed cubes CQn for small r. And we also prove other properties of CQn.
Pages: 290-294 WSEAS Transactions on Mathematics, ISSN / E-ISSN: 1109-2769 / 2224-2880, Volume 16, 2017, Art. #33 DOI: *As the DOI is a unique identifier, it is already available in the pdf version.
**The DOI link will be activated in the first midst of January 2026.
×
Citation Tools