ON THE CONNECTIVITY OF CAYLEY COLOR GRAPHS

被引：0

作者：

HUANG Qiongxiang

LIU Xin Department of Mathematics Xinjiang UniverasityUrumchi China ^{[830046
]}

机构：

来源：

SystemsScienceandMathematicalSciences | 1993年 / 03期

关键词：

Connectivity; atom; Cayley color graphs;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

<正> In this paper we obtain the necessary and sufficient condition for the connec-tivity of the Cayley color graphs or the Cayley graphs to be equal to their minimum degree.The sharp lower bounds of connectivity of Cayley color graphs and the Cayley graphs arealso obtained. Our results generalize the previous results obtained in [1] to [3].

引用

页码：227 / 230

页数：4