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...
Saved in:
Published in | Computer journal Vol. 63; no. 9; pp. 1311 - 1320 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Oxford University Press
01.09.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!