The component (edge) connectivity of shuffle-cubes
Component (edge) connectivity is a generalization of traditional (edge) connectivity. Let F be a vertex set (resp., an edge set), if G−F has at least g components, F is a g-component (edge) cut. The g-component (edge) connectivity of graph G is the minimum size of the g-component (edge) cut. In this...
Saved in:
Published in | Theoretical computer science Vol. 835; pp. 108 - 119 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
02.10.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Component (edge) connectivity is a generalization of traditional (edge) connectivity. Let F be a vertex set (resp., an edge set), if G−F has at least g components, F is a g-component (edge) cut. The g-component (edge) connectivity of graph G is the minimum size of the g-component (edge) cut. In this paper, we study the g-component (edge) connectivity of shuffle-cubes for small g. |
---|---|
ISSN: | 0304-3975 1879-2294 |
DOI: | 10.1016/j.tcs.2020.06.015 |