折叠超立方体的边邻域连通度

Edge Neighbor Connectivity of FQ_n

折叠超立方体是最受关注的网络模型之一.设e是图G的一条边,如果从图G中删掉以e为中心的双星子图,则称e"倒戈".设S为一个边集,如果S中的边全部倒戈,若剩下的子图或者不连通,或者是一个孤立点,或者是空集,则称S为G的割边策略.G的最小割边策略所含的边数为边邻域连通度.该文主要证明了折叠超立方体FQn的边邻域连通度为n.

FQn is one of the most famous network models. Let e be an edge of a graph G, We say that e is subverted, if the double star with e being its center is deleted from G. Let S be an edge set. If every edge in S is subverted, and the surviving graph is either disconnected or a single vertex or empty, then S is called to be an edge cut strategy. The number of edges in a minimum edge cut strategy is defined to be the edge neighbor connectivity. In this paper, we prove that the edge neighbor connectivity of FQn is n.