Component Connectivity of 3-Ary n-Cubes

For an integer [Formula: see text] the [Formula: see text]-component connectivity of a connected graph [Formula: see text] denoted by [Formula: see text] is the minimum number of vertices whose removal results in a graph with at least [Formula: see text] components. In this paper, we extend the result on [Formula: see text]-component connectivity of [Formula: see text]-ary [Formula: see text]-cubes for [Formula: see text] established by Lv et al. [M. Lv, J. Fan, J. Zhou et al., The reliability of [Formula: see text]-ary [Formula: see text]-cube based on component connectivity, Comput. J. 65(8) (2022) 2197–2208], to 3-ary [Formula: see text]-cubes. We show that the [Formula: see text]-component connectivity of [Formula: see text]-ary [Formula: see text]-cubes is [Formula: see text] for integers [Formula: see text] and [Formula: see text] satisfying [Formula: see text]