On Computing Component (Edge) Connectivities of Balanced Hypercubes

Abstract For an integer $\ell \geqslant 2$, the $\ell $-component connectivity (resp. $\ell $-component edge connectivity) of a graph $G$, denoted by $\kappa _{\ell }(G)$ (resp. $\lambda _{\ell }(G)$), is the minimum number of vertices (resp. edges) whose removal from $G$ results in a disconnected g...

Full description

Saved in:
Bibliographic Details
Published inComputer journal Vol. 63; no. 9; pp. 1311 - 1320
Main Authors Gu, Mei-Mei, Chang, Jou-Ming, Hao, Rong-Xia
Format Journal Article
LanguageEnglish
Published Oxford University Press 01.09.2020
Subjects
Online AccessGet full text

Cover

Loading…