{2, 3} -Extraconnectivities of hypercube-like networks

研究成果: Article同行評審

72 引文 斯高帕斯(Scopus)

摘要

A subset of vertices X is said to be a cutset if G-X is not connected. A cutset X is called an Rg-cutset if every component of G-X has at least g+1 vertices. If G has at least one Rg-cutset, the g-extraconnectivity of G is then defined as the minimum cardinality over all Rg-cutsets of G. In this paper, we first show that the 2-extraconnectivity of an n-dimensional hypercube-like network is 3n-5 for n≥5. This improves on the previously best known result, which showed that the 2-extraconnectivity of an n-dimensional hypercube-like network is 3n-5 for n≥8. We further demonstrate that the 3-extraconnectivity of an n-dimensional hypercube-like network is 4n-9 for n≥6. Based on the above results, the 2-extraconnectivity and 3-extraconnectivity of several interconnection networks, including hypercubes, twisted cubes, crossed cubes, Möbius cubes, locally twisted cubes, generalized twisted cubes, recursive circulants, and Mcubes, can be determined efficiently.

原文English
頁(從 - 到)669-688
頁數20
期刊Journal of Computer and System Sciences
79
發行號5
DOIs
出版狀態Published - 2013 8月

All Science Journal Classification (ASJC) codes

  • 理論電腦科學
  • 電腦網路與通信
  • 計算機理論與數學
  • 應用數學

指紋

深入研究「{2, 3} -Extraconnectivities of hypercube-like networks」主題。共同形成了獨特的指紋。

引用此