3-Restricted Connectivity of Folded Hypercube

Abstract

Given a graph G = (V E) where V is the node set and E is the edge set of G and a non-negative integer h the h-restricted connectivity of G is the minimum size of a set of nodes X of G where X ? V (G) such that G[V ? X] is disconnected and each node in the remaining graph has at least h neighbors denoted by kh(G) Folded hypercube FQ is a well-known network topology An n-dimensional folded hypercube FQn can be obtained from an n-dimensional hypercube by adding a specific perfect matching In this thesis we show that 3-restricted connectivity of n-dimensional folded hypercube is 8n ? 16 for n ? 6

Date of Award	2017 Aug 30
Original language	English
Supervisor	Sun-Yuan Hsieh (Supervisor)