| 一些笛卡尔乘积图的限制连通度 |
| |
| 引用本文： | 潘向峰,徐俊明,吕敏.一些笛卡尔乘积图的限制连通度[J].中国科学技术大学学报,2006,36(3):237-240. |
| |
| 作者姓名： | 潘向峰 徐俊明 吕敏 |
| |
| 作者单位： | 中国科学技术大学数学系,安徽,合肥,230026 |
| |
| 基金项目： | Supported by NNSF of China（ 10271114）. |
| |
| 摘 要： | 子集S(∩)V(G)称为限制割,若任何点v∈V(G)的邻点集NG(v)都不是S的子集且G-S不连通.若G中存在限制割,则定义限制连通度κ1(G)=min{| S|S是G的一个限制割}.考虑了笛卡尔乘积图,证明了设G=G1×G2×…×Gn,若Gi是满足某些给定条件的ki连通ki正则且围长至少为5的图,其中i=1,2,…,n,则κ1(G)=2n∑i=1ki-2.
|
| 关 键 词： | 连通度 限制连通度 正则图 笛卡尔乘积 超立方体 |
| 文章编号： | 0253-2778(2006)03-0237-04 |
| 收稿时间： | 10 18 2004 12:00AM |
| 修稿时间： | 2004年10月18 |
On restricted connectivity of some Cartesian product graphs |
| |
| PAN Xiang-feng,XU Jun-ming,LV Min.On restricted connectivity of some Cartesian product graphs[J].Journal of University of Science and Technology of China,2006,36(3):237-240. |
| |
| Authors: | PAN Xiang-feng XU Jun-ming LV Min |
| |
| Abstract: | A subset S(∩)V(G) is called a restricted cut, if it does not contain a neighbor-set of any vertex as its subset andG-S is disconnected. If there exists a restricted cut SinG, the restricted connectivity k1 (G) = min{|S| :S is a restricted cut of G}. The Cartesian product graphs are considered and k1 (G) = 2 n∑i=1 ki- 2 is obtained if for each i = 1,2,… ,n(n ≥ 3),Gi is a ki-regular ki-connected graph of girth at least 5 and satisfies some given conditions, where G = G1×G2×…×Gn. |
| |
| Keywords: | connectivity restricted connectivity regular Cartesian product hypercube |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
