| 折叠超立方体的边邻域连通度 |
| |
| 引用本文： | 王霞,朱国华,付新荣.折叠超立方体的边邻域连通度[J].广西师院学报,2009(1):25-27. |
| |
| 作者姓名： | 王霞 朱国华 付新荣 |
| |
| 作者单位： | 北京防化指挥工程学院基础部数学教研室,北京102205 |
| |
| 摘 要： | 折叠超立方体是最受关注的网络模型之一．设e是图G的一条边，如果从图G中删掉以e为中心的双星子图，则称e“倒戈”．设S为一个边集，如果S中的边全部倒戈，若剩下的子图或者不连通，或者是一个孤立点，或者是空集，则称S为G的割边策略．G的最小割边策略所含的边数为边邻域连通度．该文主要证明了折叠超立方体FQn的边邻域连通度为n．
|
| 关 键 词： | 边邻域连通度 折叠超立方体 割边策略 |
Edge Neighbor Connectivity of FQn |
| |
| WANG Xia,ZHU Guo-hua,FU Xin-rong.Edge Neighbor Connectivity of FQn[J].Journal of Guangxi Teachers College(Natural Science Edition),2009(1):25-27. |
| |
| Authors: | WANG Xia ZHU Guo-hua FU Xin-rong |
| |
| Institution: | (Teaching and Researching Section of Mathematics, Institute of Chemical Defence, Beijing 102205, China) |
| |
| Abstract: | 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. |
| |
| Keywords: | edge neighbor connectivity folded hypercube edge cut strategy |
| 本文献已被 维普 等数据库收录！ |
