Component connectivity of the hypercubes

檔案

日期

2012

期刊名稱

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS

摘要

The r-component connectivity kappa(r)(G) of the non- complete graph G is the minimum number of vertices whose deletion results in a graph with at least r components. So, kappa(2) is the usual connectivity. In this paper, we determine the r-component connectivity of the hypercube Q(n) for r = 2, 3, ..., n + 1, and we classify all the corresponding optimal solutions.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料