Abstract
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]
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
