P_k and C_k structure and substructure connectivity of hypercubes
Combinatorics
2020-06-17 v2
Abstract
Hypercube is one of the most important networks to interconnect processors in multiprocessor computer systems. Different kinds of connectivities are important parameters to measure the fault tolerability of networks. Lin et al.\cite{LinStructure} introduced the concept of -structure connectivity (resp. -substructure connectivity ) as the minimum cardinality of such that is isomorphic to (resp. such that is isomorphic to connected subgraphs of ) such that is disconnected or trivial. In this paper, we discuss and for hypercubes with and . As a by-product, we solve the problem mentioned in \cite{ManeStructure}.
Cite
@article{arxiv.2002.10134,
title = {P_k and C_k structure and substructure connectivity of hypercubes},
author = {Yihan Chen and Bicheng Zhang},
journal= {arXiv preprint arXiv:2002.10134},
year = {2020}
}
Comments
15 pages, 9 figures