Not checkedNot checked for notices yet.
Two kinds of conditional connectivity of hypercubes
Bo Zhu, Shumin Zhang, Jinyu Zou and 1 more
AKCE International Journal of Graphs and Combinatorics · 2022
doi:10.1080/09728600.2022.2132893 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
AbstractA subset [Formula: see text] is called an h-extra r-component cut of G if G – F is disconnected and there are at least r components, each component has at least h + 1 vertices. The cardinality of a minimum h-extra r-component cut of G, denoted by [Formula: see text] is the h-extra r-component connectivity of G. In this paper, we introduce a novel connectivity called the g-good r-component connectivity. For [Formula: see text] if G – F is disconnected and there are at least r components and each vertex [Formula: see text] has at least g neighbors, then F is called a g-good r-component cut of G; the g-good r-component connectivity of G, denoted by [Formula: see text] is the minimum cardinality of a g-good r-component cut of G. In this work, we prove that [Formula: see text] for [Formula: see text] and [Formula: see text] for [Formula: see text] where Qn is n-dimension hypercube.
Abstract licence: CC BY-NC
References22
22 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.