Component Edge Connectivity of Hypercube-like Networks

DOI10.1016/J.TCS.2022.01.047arXiv2105.04803MaRDI QIDQ6367341FDOQ6367341

Bicheng Zhang, Dong Liu, Pingshan Li

Publication date: 11 May 2021

Abstract: As a generalization of the traditional connectivity, the g-component edge connectivity c{lambda}g(G) of a non-complete graph G is the minimum number of edges to be deleted from the graph G such that the resulting graph has at least g components. Hypercube-like networks (HL-networks for short) are obtained by manipulating some pairs of edges in hypercubes, which contain several famous interconnection networks such as twisted cubes, Mobius cubes, crossed cubes, locally twisted cubes. In this paper, we determine the (g + 1)-component edge connectivity of the n-dimensional HL-networks.

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

This page was built for publication: Component Edge Connectivity of Hypercube-like Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6367341)