h-Extra r-Component Connectivity of 3-Ary n-Cubes

For a vertex subset [Formula: see text] of a connected graph [Formula: see text] the [Formula: see text]-extra [Formula: see text]-component connectivity of [Formula: see text] is the minimum cardinality of [Formula: see text] such that [Formula: see text] is disconnected with [Formula: see text]-components and each component contains more than [Formula: see text] vertices. It is denoted by [Formula: see text] In this paper, we investigate the [Formula: see text]-extra 3-component connectivity of [Formula: see text]-ary [Formula: see text]-cube [Formula: see text] for [Formula: see text] For [Formula: see text] [Formula: see text] and [Formula: see text]