Vertex-disjoint paths in Cayley color graphs

被引：0
|
作者：
Kulasinghe, P [1 ]
Bettayeb, S
机构：
[1] Louisiana State Univ, Dept Elect & Comp Engn, Baton Rouge, LA 70803 USA
[2] Southern Univ, Dept Comp Sci, Baton Rouge, LA 70813 USA
来源：
COMPUTERS AND ARTIFICIAL INTELLIGENCE | 1997年 / 16卷 / 06期
关键词：
Cayley color graph; Cayley graph; cost subgraph; interconnection network; strong connectivity; vertex symmetry;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
In this paper, we study the strong connectivity of Cayley color graphs when a certain number of vertices are removed. We prove that there are \Delta\ vertex-disjoint paths from every vertex to every other vertex in a Cayley color graph associated with a finite group Gamma and a non redundant generating set Delta for Gamma. We also extend this result to a certain class of Cayley graphs.
引用
收藏
页码：583 / 597
页数：15
相关论文
共 50 条
12345