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...

Full description

Saved in:
Bibliographic Details
Published inTheoretical computer science Vol. 835; pp. 108 - 119
Main Authors Ding, Tongtong, Li, Pingshan, Xu, Min
Format Journal Article
LanguageEnglish
Published Elsevier B.V 02.10.2020
Subjects
Component connectivity
Component edge connectivity
Connectivity
Shuffle-cubes
Component connectivity
Shuffle-cubes
Connectivity
Component edge connectivity
Online AccessGet full text

Cover

More Information
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