k度Cayley图顶点等周集的若干性质(英文)  

Properties of Isoperimetric Sets in k-degree Cayley Graphs

作　　者：黄占涛[1] 

机构地区：[1]南开大学数学科学学院,天津300071

出　　处：《南开大学学报（自然科学版）》2009年第6期57-62,共6页Acta Scientiarum Naturalium Universitatis Nankaiensis

摘　　要：主要讨论了k度Cayley图G_(n,k)的顶点等周集的若干性质.k度Cayley图被设计用于构建互联网络.证明了对于满足k≥5的k度Cayley图,没有部分覆盖任意一个完全子图的顶点等周集是肯定存在的.This paper focused on the properties of isoperimetric set in k-degree Cayley graphs, which was proposed for building interconneetion networks. It is proved that there exists an isoperimetric set which makes each sub-clique either fully covered or completely uncovered for k-degree Cayley graphs with k≥5.

关 键 词：顶点等周集 k度Cayley图 

分 类 号：O157.5[理学—数学]